Sciweavers

Share
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
9 years 9 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
KDD
2003
ACM
149views Data Mining» more  KDD 2003»
9 years 9 months ago
Knowledge-based data mining
We describe techniques for combining two types of knowledge systems: expert and machine learning. Both the expert system and the learning system represent information by logical d...
Søren Damgaard, Sholom M. Weiss, Shubir Kap...
KDD
2003
ACM
120views Data Mining» more  KDD 2003»
9 years 9 months ago
On detecting differences between groups
Understanding the differences between contrasting groups is a fundamental task in data analysis. This realization has led to the development of a new special purpose data mining t...
Geoffrey I. Webb, Shane M. Butler, Douglas A. Newl...
KDD
2003
ACM
113views Data Mining» more  KDD 2003»
9 years 9 months ago
Mining unexpected rules by pushing user dynamics
Unexpected rules are interesting because they are either previously unknown or deviate from what prior user knowledge would suggest. In this paper, we study three important issues...
Ke Wang, Yuelong Jiang, Laks V. S. Lakshmanan
KDD
2003
ACM
148views Data Mining» more  KDD 2003»
9 years 9 months ago
Mining concept-drifting data streams using ensemble classifiers
Recently, mining data streams with concept drifts for actionable insights has become an important and challenging task for a wide range of applications including credit card fraud...
Haixun Wang, Wei Fan, Philip S. Yu, Jiawei Han
KDD
2003
ACM
113views Data Mining» more  KDD 2003»
9 years 9 months ago
Indexing multi-dimensional time-series with support for multiple distance measures
Although most time-series data mining research has concentrated on providing solutions for a single distance function, in this work we motivate the need for a single index structu...
Michail Vlachos, Marios Hadjieleftheriou, Dimitrio...
KDD
2003
ACM
210views Data Mining» more  KDD 2003»
9 years 9 months ago
Privacy-preserving k-means clustering over vertically partitioned data
Privacy and security concerns can prevent sharing of data, derailing data mining projects. Distributed knowledge discovery, if done correctly, can alleviate this problem. The key ...
Jaideep Vaidya, Chris Clifton
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
9 years 9 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
KDD
2003
ACM
132views Data Mining» more  KDD 2003»
9 years 9 months ago
PaintingClass: interactive construction, visualization and exploration of decision trees
Decision trees are commonly used for classification. We propose to use decision trees not just for classification but also for the wider purpose of knowledge discovery, because vi...
Soon Tee Teoh, Kwan-Liu Ma
books