Sciweavers

1756 search results - page 96 / 352
» Mining Query Logs
Sort
View
110
Voted
CIKM
2009
Springer
15 years 7 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
USS
2010
14 years 10 months ago
Searching the Searchers with SearchAudit
Search engines not only assist normal users, but also provide information that hackers and other malicious entities can exploit in their nefarious activities. With carefully craft...
John P. John, Fang Yu, Yinglian Xie, Martín...
ICDT
2009
ACM
119views Database» more  ICDT 2009»
16 years 1 months ago
Analysis of sampling techniques for association rule mining
In this paper, we present a comprehensive theoretical analysis of the sampling technique for the association rule mining problem. Most of the previous works have concentrated only...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogi...
105
Voted
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
15 years 2 months ago
Entropy-preserving cuttings and space-efficient planar point location
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
Sunil Arya, Theocharis Malamatos, David M. Mount
118
Voted
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
15 years 2 months ago
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
Guy E. Blelloch