Sciweavers

237 search results - page 21 / 48
» Methods for Achieving Fast Query Times in Point Location Dat...
Sort
View
ADVIS
2004
Springer
14 years 1 months ago
Incremental Association Rule Mining Using Materialized Data Mining Views
Data mining is an interactive and iterative process. Users issue series of similar queries until they receive satisfying results, yet currently available data mining systems do not...
Mikolaj Morzy, Tadeusz Morzy, Zbyszko Króli...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 15 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
13 years 11 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
ICML
2006
IEEE
14 years 4 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford
EDBT
2009
ACM
110views Database» more  EDBT 2009»
14 years 15 days ago
A sampling approach for XML query selectivity estimation
As the Extensible Markup Language (XML) rapidly establishes itself as the de facto standard for presenting, storing, and exchanging data on the Internet, large volume of XML data ...
Cheng Luo, Zhewei Jiang, Wen-Chi Hou, Feng Yu, Qia...