156 search results - page 14 / 32 » The UCI KDD Archive of Large Data Sets for Data Mining Resea... |
KDD
2007
ACM
14 years 8 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
KDD
1997
ACM
13 years 11 months ago
1997
ACM
One of the important problems in data mining is the evaluation of subjective interestingness of the discovered rules. Past research has found that in many real-life applications i...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
KDD
2009
ACM
14 years 2 months ago
2009
ACM
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...