Sciweavers

1291 search results - page 190 / 259
» Learning Rules from Distributed Data
Sort
View
NIPS
1998
15 years 3 months ago
A Polygonal Line Algorithm for Constructing Principal Curves
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...
Balázs Kégl, Adam Krzyzak, Tam&aacut...
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
16 years 2 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...
ICML
2004
IEEE
16 years 3 months ago
Testing the significance of attribute interactions
Attribute interactions are the irreducible dependencies between attributes. Interactions underlie feature relevance and selection, the structure of joint probability and classific...
Aleks Jakulin, Ivan Bratko
108
Voted
ICML
2003
IEEE
16 years 3 months ago
Testing Exchangeability On-Line
The majority of theoretical work in machine learning is done under the assumption of exchangeability: essentially, it is assumed that the examples are generated from the same prob...
Vladimir Vovk, Ilia Nouretdinov, Alexander Gammerm...
ICDM
2007
IEEE
289views Data Mining» more  ICDM 2007»
15 years 8 months ago
Latent Dirichlet Conditional Naive-Bayes Models
In spite of the popularity of probabilistic mixture models for latent structure discovery from data, mixture models do not have a natural mechanism for handling sparsity, where ea...
Arindam Banerjee, Hanhuai Shan