Sciweavers

5608 search results - page 877 / 1122
» On the Theory of Matchgate Computations
Sort
View
KDD
2009
ACM
193views Data Mining» more  KDD 2009»
16 years 7 months ago
Probabilistic frequent itemset mining in uncertain databases
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
Andreas Züfle, Florian Verhein, Hans-Peter Kr...
KDD
2008
ACM
224views Data Mining» more  KDD 2008»
16 years 7 months ago
The structure of information pathways in a social communication network
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
Gueorgi Kossinets, Jon M. Kleinberg, Duncan J. Wat...
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 7 months ago
Weighted graphs and disconnected components: patterns and a generator
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
Mary McGlohon, Leman Akoglu, Christos Faloutsos
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
16 years 7 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 7 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky