Sciweavers

6094 search results - page 1071 / 1219
» Applications of a Color-Naming Database
Sort
View
123
Voted
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
16 years 5 months ago
GraphScope: parameter-free mining of large time-evolving graphs
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
Jimeng Sun, Christos Faloutsos, Spiros Papadimitri...
KDD
2006
ACM
146views Data Mining» more  KDD 2006»
16 years 5 months ago
Structure and evolution of online social networks
In this paper, we consider the evolution of structure within large online social networks. We present a series of measurements of two such networks, together comprising in excess ...
Ravi Kumar, Jasmine Novak, Andrew Tomkins
116
Voted
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
16 years 5 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
152
Voted
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 5 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
KDD
2006
ACM
147views Data Mining» more  KDD 2006»
16 years 5 months ago
Summarizing itemset patterns using probabilistic models
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
Chao Wang, Srinivasan Parthasarathy
« Prev « First page 1071 / 1219 Last » Next »