Sciweavers

820 search results - page 9 / 164
» Finding low-utility data structures
Sort
View
ICML
2003
IEEE
14 years 9 months ago
Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
Jeremy Kubica, Andrew W. Moore, David Cohn, Jeff G...
PAKDD
2010
ACM
203views Data Mining» more  PAKDD 2010»
14 years 1 months ago
Finding Itemset-Sharing Patterns in a Large Itemset-Associated Graph
Both itemset mining and graph mining have been studied independently. Here, we introduce a novel data structure, which is an unweighted graph whose vertices contain itemsets. From ...
Mutsumi Fukuzaki, Mio Seki, Hisashi Kashima, Jun S...
NETWORKING
2004
13 years 10 months ago
A Geometric Derivation of the Probability of Finding a Relay in Multi-rate Networks
Abstract. Relaying can improve performance of a wireless network, especially when different transmission modes with distance/cost tradeoffs are available. Examples of such modes in...
Laura Marie Feeney, Daniel Hollos, Martin Kubisch,...
SIGIR
2006
ACM
14 years 2 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
ICDM
2007
IEEE
166views Data Mining» more  ICDM 2007»
14 years 2 months ago
A Divisive Hierarchical Structural Clustering Algorithm for Networks
Many systems in sciences, engineering and nature can be modeled as networks. Examples are internet, metabolic networks and social networks. Network clustering algorithms aimed to ...
Nurcan Yuruk, Mutlu Mete, Xiaowei Xu, Thomas A. J....