Sciweavers

5463 search results - page 770 / 1093
» Evaluating algorithms that learn from data streams
Sort
View
ICDM
2007
IEEE
184views Data Mining» more  ICDM 2007»
16 years 1 months ago
Bayesian Folding-In with Dirichlet Kernels for PLSI
Probabilistic latent semantic indexing (PLSI) represents documents of a collection as mixture proportions of latent topics, which are learned from the collection by an expectation...
Alexander Hinneburg, Hans-Henning Gabriel, Andr&eg...
AUTOMATICA
2006
81views more  AUTOMATICA 2006»
15 years 7 months ago
An energy-gain bounding approach to robust fuzzy identification
A novel method for the robust identification of interpretable fuzzy models, based on the criterion that identification errors are least sensitive to data uncertainties and modelli...
Mohit Kumar, Norbert Stoll, Regina Stoll
212
Voted
KDD
2003
ACM
122views Data Mining» more  KDD 2003»
16 years 8 months ago
Understanding captions in biomedical publications
From the standpoint of the automated extraction of scientific knowledge, an important but little-studied part of scientific publications are the figures and accompanying captions....
William W. Cohen, Richard C. Wang, Robert F. Murph...
202
Voted
KDD
2006
ACM
183views Data Mining» more  KDD 2006»
16 years 8 months ago
Discovering interesting patterns through user's interactive feedback
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
Dong Xin, Xuehua Shen, Qiaozhu Mei, Jiawei Han
ML
2008
ACM
248views Machine Learning» more  ML 2008»
15 years 7 months ago
Feature selection via sensitivity analysis of SVM probabilistic outputs
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
Kai Quan Shen, Chong Jin Ong, Xiao Ping Li, Einar ...