2014
DOI: 10.1145/2656344
|View full text |Cite
|
Sign up to set email alerts
|

Merging Query Results From Local Search Engines for Georeferenced Objects

Abstract: The emergence of numerous online sources about local services presents a need for more automatic yet accurate data integration techniques. Local services are georeferenced objects and can be queried by their locations on a map, for instance, neighborhoods. Typical local service queries (e.g., "French Restaurant in The Loop") include not only information about "what" ("French Restaurant") a user is searching for (such as cuisine) but also "where" information, such as neighborhood ("The Loop"). In this article, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 42 publications
0
4
0
Order By: Relevance
“…The work on RL can be broadly classified into three categories: (i) effective RL, (ii) optimal selection of similarity measures, and (iii) efficient RL. The works in (i) [4,5,10,11,17,32,37,38] employ a broad range of machine learning techniques such as decision trees, SVM, logistic regression, correlation mining, and clustering. In (ii), the goal is to automatically select optimal similarity functions [7] for each attribute of an entity (e.g., using edit distance for the attribute phone and Jaccard distance for name) and determine similarity thresholds [31].…”
Section: Related Workmentioning
confidence: 99%
“…The work on RL can be broadly classified into three categories: (i) effective RL, (ii) optimal selection of similarity measures, and (iii) efficient RL. The works in (i) [4,5,10,11,17,32,37,38] employ a broad range of machine learning techniques such as decision trees, SVM, logistic regression, correlation mining, and clustering. In (ii), the goal is to automatically select optimal similarity functions [7] for each attribute of an entity (e.g., using edit distance for the attribute phone and Jaccard distance for name) and determine similarity thresholds [31].…”
Section: Related Workmentioning
confidence: 99%
“…Second, determine the records in all the lists L i that refer to the same entity (i.e., apply record linkage [4] across all the lists). We use our record linkage algorithm reported in [33]. This is assumed to be known for the queries in Q gold .…”
Section: Per Query Weight Estimationmentioning
confidence: 99%
“…After a query is processed by the selected resources, a ranked list of documents from each resource are retrieved to the broker [52]. Finally, the broker merges the obtained results into a unified ranked list for presentation to the user [12,13,54]. This paper focuses on resource representation and selection in DIR.…”
Section: Introductionmentioning
confidence: 99%