Sciweavers

ICDM
2005
IEEE
150views Data Mining» more  ICDM 2005»
13 years 10 months ago
Combining Multiple Clusterings by Soft Correspondence
Combining multiple clusterings arises in various important data mining scenarios. However, finding a consensus clustering from multiple clusterings is a challenging task because ...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
ICDM
2005
IEEE
126views Data Mining» more  ICDM 2005»
13 years 10 months ago
Text Representation: From Vector to Tensor
In this paper, we propose a text representation model, Tensor Space Model (TSM), which models the text by multilinear algebraic high-order tensor instead of the traditional vector...
Ning Liu, Benyu Zhang, Jun Yan, Zheng Chen, Wenyin...
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
13 years 10 months ago
Discovering Frequent Arrangements of Temporal Intervals
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
Panagiotis Papapetrou, George Kollios, Stan Sclaro...
ICDM
2005
IEEE
133views Data Mining» more  ICDM 2005»
13 years 10 months ago
Parameter-Free Spatial Data Mining Using MDL
Consider spatial data consisting of a set of binary features taking values over a collection of spatial extents (grid cells). We propose a method that simultaneously finds spatia...
Spiros Papadimitriou, Aristides Gionis, Panayiotis...
ICDM
2005
IEEE
122views Data Mining» more  ICDM 2005»
13 years 10 months ago
Finding Representative Set from Massive Data
In the information age, data is pervasive. In some applications, data explosion is a significant phenomenon. The massive data volume poses challenges to both human users and comp...
Feng Pan, Wei Wang 0010, Anthony K. H. Tung, Jiong...
ICDM
2005
IEEE
163views Data Mining» more  ICDM 2005»
13 years 10 months ago
Balancing Exploration and Exploitation: A New Algorithm for Active Machine Learning
Active machine learning algorithms are used when large numbers of unlabeled examples are available and getting labels for them is costly (e.g. requiring consulting a human expert)...
Thomas Takeo Osugi, Kun Deng, Stephen D. Scott
ICDM
2005
IEEE
162views Data Mining» more  ICDM 2005»
13 years 10 months ago
Mining Patterns That Respond to Actions
Data mining focuses on patterns that summarize the data. In this paper, we focus on mining patterns that could change the state by responding to opportunities of actions.
Yuelong Jiang, Ke Wang, Alexander Tuzhilin, Ada Wa...
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
13 years 10 months ago
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
Loïck Lhote, François Rioult, Arnaud S...
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
13 years 10 months ago
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as po...
Daniel Lemire, Martin Brooks, Yuhong Yan
ICDM
2005
IEEE
215views Data Mining» more  ICDM 2005»
13 years 10 months ago
CLUGO: A Clustering Algorithm for Automated Functional Annotations Based on Gene Ontology
We address the issue of providing highly informative and comprehensive annotations using information revealed by the structured vocabularies of Gene Ontology (GO). For a target, a...
In-Yee Lee, Jan-Ming Ho, Ming-Syan Chen