Sciweavers

649 search results - page 69 / 130
» Some Methods of Replacing the Nearest Neighbor Method
Sort
View
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 7 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
ICCV
2007
IEEE
14 years 2 months ago
Contextual Distance for Data Perception
Structural perception of data plays a fundamental role in pattern analysis and machine learning. In this paper, we develop a new structural perception of data based on local conte...
Deli Zhao, Zhouchen Lin, Xiaoou Tang
WSC
1997
13 years 9 months ago
Cooperative Learning in Simulation
Traditionally, class periods have meant that students listen to a professor lecture for about an hour. Cooperative learning can replace some of that lecture time with methods desi...
Harriet Black Nembhard
TKDE
2011
332views more  TKDE 2011»
13 years 2 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose
IPM
2007
106views more  IPM 2007»
13 years 7 months ago
Patent document categorization based on semantic structural information
The number of patent documents is currently rising rapidly worldwide, creating the need for an automatic categorization system to replace time-consuming and labor-intensive manual...
Jae-Ho Kim, Key-Sun Choi