Sciweavers

1215 search results - page 103 / 243
» Numbers in Multi-relational Data Mining
Sort
View
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
15 years 6 months ago
Boosting Optimal Logical Patterns Using Noisy Data
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
Noam Goldberg, Chung-chieh Shan
ICDM
2006
IEEE
122views Data Mining» more  ICDM 2006»
15 years 10 months ago
Optimal Segmentation Using Tree Models
Sequence data are abundant in application areas such as computational biology, environmental sciences, and telecommunications. Many real-life sequences have a strong segmental str...
Robert Gwadera, Aristides Gionis, Heikki Mannila
ICDM
2005
IEEE
163views Data Mining» more  ICDM 2005»
15 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
SDM
2004
SIAM
225views Data Mining» more  SDM 2004»
15 years 6 months ago
Active Semi-Supervision for Pairwise Constrained Clustering
Semi-supervised clustering uses a small amount of supervised data to aid unsupervised learning. One typical approach specifies a limited number of must-link and cannotlink constra...
Sugato Basu, Arindam Banerjee, Raymond J. Mooney
PAKDD
2007
ACM
158views Data Mining» more  PAKDD 2007»
15 years 10 months ago
Density-Sensitive Evolutionary Clustering
In this study, we propose a novel evolutionary algorithm-based clustering method, named density-sensitive evolutionary clustering (DSEC). In DSEC, each individual is a sequence of ...
Maoguo Gong, Licheng Jiao, Ling Wang, Liefeng Bo