Sciweavers

242 search results - page 18 / 49
» Fast Indexes and Algorithms for Set Similarity Selection Que...
Sort
View
SDM
2009
SIAM
125views Data Mining» more  SDM 2009»
14 years 5 months ago
Providing Privacy through Plausibly Deniable Search.
Query-based web search is an integral part of many people’s daily activities. Most do not realize that their search history can be used to identify them (and their interests). I...
Chris Clifton, Mummoorthy Murugesan
CIKM
2009
Springer
14 years 3 months ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
DAWAK
1999
Springer
14 years 22 days ago
Efficient Bulk Loading of Large High-Dimensional Indexes
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
Christian Böhm, Hans-Peter Kriegel
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
14 years 1 months ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs
ICDE
2008
IEEE
139views Database» more  ICDE 2008»
14 years 2 months ago
Compact Similarity Joins
— Similarity joins have attracted significant interest, with applications in Geographical Information Systems, astronomy, marketing analyzes, and anomaly detection. However, all...
Brent Bryan, Frederick Eberhardt, Christos Falouts...