Sciweavers

KDD
2006
ACM
173views Data Mining» more  KDD 2006»
14 years 9 months ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
14 years 9 months ago
Group formation in large social networks: membership, growth, and evolution
The processes by which communities come together, attract new members, and develop over time is a central research issue in the social sciences -- political movements, professiona...
Lars Backstrom, Daniel P. Huttenlocher, Jon M. Kle...
KDD
2007
ACM
139views Data Mining» more  KDD 2007»
14 years 9 months ago
Looking for Great Ideas: Analyzing the Innovation Jam
We discuss the Innovation Jam that IBM carried out in 2006, with the objective of identifying innovative and promising "Big Ideas" through a moderated on-line discussion...
Wojciech Gryc, Mary E. Helander, Richard D. Lawren...
KDD
2007
ACM
143views Data Mining» more  KDD 2007»
14 years 9 months ago
Mining Research Communities in Bibliographical Data
Abstract. Extracting information from very large collections of structured, semistructured or even unstructured data can be a considerable challenge when much of the hidden informa...
Osmar R. Zaïane, Jiyang Chen, Randy Goebel
KDD
2007
ACM
198views Data Mining» more  KDD 2007»
14 years 9 months ago
Applying Link-Based Classification to Label Blogs
In analyzing data from social and communication networks, we encounter the problem of classifying objects where there is an explicit link structure amongst the objects. We study t...
Smriti Bhagat, Graham Cormode, Irina Rozenbaum
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 9 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
14 years 9 months ago
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
Rhonda Chaytor
KDD
2007
ACM
121views Data Mining» more  KDD 2007»
14 years 9 months ago
Preserving the Privacy of Sensitive Relationships in Graph Data
Abstract. In this paper, we focus on the problem of preserving the privacy of sensitive relationships in graph data. We refer to the problem of inferring sensitive relationships fr...
Elena Zheleva, Lise Getoor
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
14 years 9 months ago
Privacy-Preserving Sharing of Horizontally-Distributed Private Data for Constructing Accurate Classifiers
Data mining tasks such as supervised classification can often benefit from a large training dataset. However, in many application domains, privacy concerns can hinder the construc...
Vincent Yan Fu Tan, See-Kiong Ng