Sciweavers

2058 search results - page 338 / 412
» Trajectory pattern mining
Sort
View
KDD
2005
ACM
117views Data Mining» more  KDD 2005»
15 years 10 months ago
Rule extraction from linear support vector machines
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
Glenn Fung, Sathyakama Sandilya, R. Bharat Rao
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
15 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
2004
ACM
190views Data Mining» more  KDD 2004»
15 years 10 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
KDD
2004
ACM
170views Data Mining» more  KDD 2004»
15 years 10 months ago
Why collective inference improves relational classification
Procedures for collective inference make simultaneous statistical judgments about the same variables for a set of related data instances. For example, collective inference could b...
David Jensen, Jennifer Neville, Brian Gallagher
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
15 years 10 months ago
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...