Sciweavers

14649 search results - page 2796 / 2930
» Principles of problem solving
Sort
View
KDD
2007
ACM
209views Data Mining» more  KDD 2007»
16 years 5 months ago
Temporal causal modeling with graphical granger methods
The need for mining causality, beyond mere statistical correlations, for real world problems has been recognized widely. Many of these applications naturally involve temporal data...
Andrew Arnold, Yan Liu, Naoki Abe
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
16 years 5 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 5 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
16 years 5 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
169
Voted
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
16 years 5 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...
« Prev « First page 2796 / 2930 Last » Next »