Sciweavers

14161 search results - page 2574 / 2833
» On generalized middle-level problem
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
KDD
2005
ACM
170views Data Mining» more  KDD 2005»
16 years 7 months ago
Parallel mining of closed sequential patterns
Discovery of sequential patterns is an essential data mining task with broad applications. Among several variations of sequential patterns, closed sequential pattern is the most u...
Shengnan Cong, Jiawei Han, David A. Padua
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 7 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
16 years 7 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
16 years 7 months ago
Eigenspace-based anomaly detection in computer systems
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
Hisashi Kashima, Tsuyoshi Idé
« Prev « First page 2574 / 2833 Last » Next »