Sciweavers

57 search results - page 9 / 12
» High-Dimensional Similarity Search Using Data-Sensitive Spac...
Sort
View
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
15 years 9 months ago
Content-based document routing and index partitioning for scalable similarity-based searches in a large corpus
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
Deepavali Bhagwat, Kave Eshghi, Pankaj Mehra
CEC
2005
IEEE
15 years 3 months ago
Improvements to the scalability of multiobjective clustering
In previous work, we have proposed a novel approach to data clustering based on the explicit optimization of a partitioning with respect to two complementary clustering objectives ...
Julia Handl, Joshua D. Knowles
EDBT
2008
ACM
169views Database» more  EDBT 2008»
15 years 9 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
121
Voted
BTW
2009
Springer
240views Database» more  BTW 2009»
14 years 10 months ago
Efficient Adaptive Retrieval and Mining in Large Multimedia Databases
Abstract: Multimedia databases are increasingly common in science, business, entertainment and many other applications. Their size and high dimensionality of features are major cha...
Ira Assent
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
15 years 9 months ago
Sampling cube: a framework for statistical olap over sampling data
Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are g...
Xiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, Y...