259 search results - page 39 / 52 » Clustering for Approximate Similarity Search in High-Dimensi... |
EWCBR
2006
Springer
15 years 1 months ago
2006
Springer
Feature selection for unsupervised tasks is particularly challenging, especially when dealing with text data. The increase in online documents and email communication creates a nee...
87
Voted
AINA
2007
IEEE
15 years 4 months ago
2007
IEEE
— Efficient searching is one of the important design issues in peer-to-peer (P2P) networks. Among various searching techniques, semantic-based searching has drawn significant a...
100
click to vote
IS
2008
14 years 9 months ago
2008
Performing data mining tasks in streaming data is considered a challenging research direction, due to the continuous data evolution. In this work, we focus on the problem of clust...
133
click to vote
CVPR
2012
IEEE
13 years 2 days ago
2012
IEEE
A new data structure for efficient similarity search in very large datasets of high-dimensional vectors is introduced. This structure called the inverted multi-index generalizes ...
166
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
In this paper, we will look at substructure clustering of sequential 3d objects. A sequential 3d object is a set of points located in a three dimensional space that are linked up ...