Sciweavers

1046 search results - page 158 / 210
» Personal Digital Document Management
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 9 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 9 months ago
Mobile call graphs: beyond power-law and lognormal distributions
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distr...
Mukund Seshadri, Sridhar Machiraju, Ashwin Sridhar...
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
14 years 9 months ago
Spotting out emerging artists using geo-aware analysis of P2P query strings
Record label companies would like to identify potential artists as early as possible in their careers, before other companies approach the artists with competing contracts. The va...
Noam Koenigstein, Yuval Shavitt, Tomer Tankel
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
14 years 9 months ago
Hypergraph spectral learning for multi-label classification
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Liang Sun, Shuiwang Ji, Jieping Ye
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 9 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...