Sciweavers

110 search results - page 10 / 22
» kdd 2005
Sort
View
KDD
2005
ACM
168views Data Mining» more  KDD 2005»
14 years 10 months ago
Nomograms for visualizing support vector machines
We propose a simple yet potentially very effective way of visualizing trained support vector machines. Nomograms are an established model visualization technique that can graphica...
Aleks Jakulin, Martin Mozina, Janez Demsar, Ivan B...
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 10 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
14 years 10 months ago
Optimizing time series discretization for knowledge discovery
Knowledge Discovery in time series usually requires symbolic time series. Many discretization methods that convert numeric time series to symbolic time series ignore the temporal ...
Alfred Ultsch, Fabian Mörchen
KDD
2005
ACM
109views Data Mining» more  KDD 2005»
14 years 10 months ago
Formulating distance functions via the kernel trick
Tasks of data mining and information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be for...
Gang Wu, Edward Y. Chang, Navneet Panda
KDD
2005
ACM
107views Data Mining» more  KDD 2005»
14 years 3 months ago
Cross-relational clustering with user's guidance
Clustering is an essential data mining task with numerous applications. However, data in most real-life applications are high-dimensional in nature, and the related information of...
Xiaoxin Yin, Jiawei Han, Philip S. Yu