Sciweavers

1701 search results - page 259 / 341
» Providing k-anonymity in data mining
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 7 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
PROMISE
2010
13 years 4 months ago
Case-based reasoning vs parametric models for software quality optimization
Background: There are many data mining methods but few comparisons between them. For example, there are at least two ways to build quality optimizers, programs that find project o...
Adam Brady, Tim Menzies
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 10 months ago
Learning optimal ranking with tensor factorization for tag recommendation
Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or de...
Steffen Rendle, Leandro Balby Marinho, Alexandros ...
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
14 years 10 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
2000
ACM
97views Data Mining» more  KDD 2000»
14 years 1 months ago
Towards an effective cooperation of the user and the computer for classification
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
Mihael Ankerst, Martin Ester, Hans-Peter Kriegel