Sciweavers

436 search results - page 25 / 88
» On Monotone Data Mining Languages
Sort
View
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 8 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
2003
ACM
124views Data Mining» more  KDD 2003»
14 years 8 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...
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
14 years 1 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
13 years 9 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire
DEXAW
2005
IEEE
133views Database» more  DEXAW 2005»
13 years 9 months ago
Inductive Databases: Towards a New Generation of Databases for Knowledge Discovery
Data mining applications are typically used in the decision making process. The Knowledge Discovery Process (KDD process for short) is a typical iterative process, in which not on...
Rosa Meo