Sciweavers

1339 search results - page 184 / 268
» Robust learning from bites for data mining
Sort
View
KDD
2000
ACM
153views Data Mining» more  KDD 2000»
13 years 11 months ago
The generalized Bayesian committee machine
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
Volker Tresp
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
14 years 8 months ago
Probabilistic author-topic models for information discovery
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...
Mark Steyvers, Padhraic Smyth, Michal Rosen-Zvi, T...
CIKM
2000
Springer
14 years 2 days ago
Analyzing the Effectiveness and Applicability of Co-training
Recently there has been significant interest in supervised learning algorithms that combine labeled and unlabeled data for text learning tasks. The co-training setting [1] applie...
Kamal Nigam, Rayid Ghani
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
14 years 2 months ago
Hunting for Coherent Co-clusters in High Dimensional and Noisy Datasets
Clustering problems often involve datasets where only a part of the data is relevant to the problem, e.g., in microarray data analysis only a subset of the genes show cohesive exp...
Meghana Deodhar, Joydeep Ghosh, Gunjan Gupta, Hyuk...
TSE
2008
91views more  TSE 2008»
13 years 7 months ago
Privately Finding Specifications
Buggy software is a reality and automated techniques for discovering bugs are highly desirable. A specification describes the correct behavior of a program. For example, a file mus...
Westley Weimer, Nina Mishra