[HTML][HTML] Approximate similarity search: A multi-faceted problem
We review the major paradigms for approximate similarity queries and propose a
classification schema that easily allows existing approaches to be compared along several …
classification schema that easily allows existing approaches to be compared along several …
DAHC-tree: An effective index for approximate search in high-dimensional metric spaces
Similarity search in high-dimensional metric spaces is a key operation in many applications,
such as multimedia databases, image retrieval, object recognition, and others. The high …
such as multimedia databases, image retrieval, object recognition, and others. The high …
Fast anytime retrieval with confidence in large-scale temporal case bases
This work is about speeding up retrieval in Case-Based Reasoning (CBR) for large-scale
case bases (CBs) comprised of temporally related cases in metric spaces. A typical example …
case bases (CBs) comprised of temporally related cases in metric spaces. A typical example …
Efficient query rewrite for structured web queries
S Gollapudi, S Ieong, A Ntoulas… - Proceedings of the 20th …, 2011 - dl.acm.org
Web search engines incorporate results from structured data sources to answer semantically
rich user queries, ie Samsung 50 inch led tv can be answered from a table of television data …
rich user queries, ie Samsung 50 inch led tv can be answered from a table of television data …
The Cascading Metric Tree
J Uhlmann, MR Zuniga - arxiv preprint arxiv:2112.10900, 2021 - arxiv.org
This paper presents the Cascaded Metric Tree (CMT) for efficient satisfaction of metric
search queries over a dataset of N objects. It provides extra information that permits query …
search queries over a dataset of N objects. It provides extra information that permits query …
[PDF][PDF] A novel approach for making recommendation using skyline query based on user location and preference
Objectives: To propose a method to handle large number of user and to improve the
accuracy and quality of recommendation system. Methods/Statistical Analysis: This paper …
accuracy and quality of recommendation system. Methods/Statistical Analysis: This paper …
Capacity value of wind power using kd tree and nearest neighbor search algorithm
Electrical power demand is increasing cumulatively with the increase in population.
Economic and environmental impacts restrict the expansion of conventional generation but …
Economic and environmental impacts restrict the expansion of conventional generation but …
[PDF][PDF] A Hierarchical Anytime k-NN Classifier for Large-Scale High-Speed Data Streams
JSC Aarti, H Harsh, D Utkarsh, M Agarwal… - pdfs.semanticscholar.org
The k-Nearest Neighbor Classifier (k-NN) is a widely used classification technique used in
data streams. However, traditional k-NN-based stream classification algorithms can't handle …
data streams. However, traditional k-NN-based stream classification algorithms can't handle …
Anytime Case-Based Reasoning in Large-Scale Temporal Case Bases
MO Mülâyim - 2020 - ddd.uab.cat
L'enfocament de la metodologia Casi-Based Reasoning (CBR) per a la resolució de
problemes que" problemes similars tenen solucions similars" ha demostrat ser bastant …
problemes que" problemes similars tenen solucions similars" ha demostrat ser bastant …
Approximate Search on Massive Spatiotemporal Datasets
Efficient time series similarity search is a fundamental operation for data exploration and
analysis. While previous work has focused on indexing progressively larger datasets and …
analysis. While previous work has focused on indexing progressively larger datasets and …