1994
DOI: 10.21236/ada286291
|View full text |Cite
|
Sign up to set email alerts
|

MAC/FAC: A Model of Similarity-Based Retrieval

Abstract: Puojbc reoorting ouraen for this c e(tontt )t formaton o S est atno to averat e S"our per resporse. ,~luOdng the time 4or reviewing istructiOns. searchtng existing data sources, ga theremg and mtant.3jC ng the data needed, ani con-peting and rev,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
51
0

Year Published

2006
2006
2022
2022

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 29 publications
(52 citation statements)
references
References 38 publications
1
51
0
Order By: Relevance
“…[6, chs. 8-10], and also [7]) our architecture (see Fig. 2) supports a two-stage process for diagram retrieval: reminding (or initial recall), and selection.…”
Section: The Retrieval Taskmentioning
confidence: 80%
See 1 more Smart Citation
“…[6, chs. 8-10], and also [7]) our architecture (see Fig. 2) supports a two-stage process for diagram retrieval: reminding (or initial recall), and selection.…”
Section: The Retrieval Taskmentioning
confidence: 80%
“…MAC/FAC [7] is a well-known model of two-stage analogical retrieval and mapping based on the Structure Mapping Engine (SME) [12]. It employs a heuristic much like our feature vectors for the first stage, computing "content vectors" for each source analog in memory that count the object attributes and higher-order relations contained in the description.…”
Section: Discussionmentioning
confidence: 99%
“…Recently, a probabilistic similarity model for workflow execution paths was also proposed (Becker, Bergener, Breuker, & Räckers, 2011). Other approaches have suggested the use of a two-step procedure, which combines an initial and comparatively inexpensive retrieval step, to winnow the instances to be considered, with a more expensive strategy that ranks the remaining instances (as in the well-known MAC/FAC system (Forbus, Gentner, & Law, 1995)) (KendallMorwick & Leake, 2011. In Bergmann and Gil (2014), some procedures for non-exhaustive search, based on the A ⁄ algorithm, are provided.…”
Section: Related Workmentioning
confidence: 99%
“…We will have more to say on this later in this article.) Nearly all computational models rely on a process whereby hierarchies or graphs are matched on the basis of similarity (shared features and shared relations), empty feature slots are filled by a process of mapping or filtering, or there is some process of restructuring of relations (Burns, 1995;Forbus, Gentner, & Law, 1995;Hall, 1988;Holyoak, Novick, & Melz, 1994;Markman & Gentner, 2000). AI models include other techniques, such as constraint satisfaction (Thagard, Holyoak, Nelson, & Gochfeld, 1990).…”
Section: Analogy and Computer Sciencementioning
confidence: 99%