Sciweavers

2705 search results - page 203 / 541
» Privacy in Data Mining Using Formal Methods
Sort
View
155
Voted
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 2 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
EUSFLAT
2007
105views Fuzzy Logic» more  EUSFLAT 2007»
15 years 3 months ago
SPoID: Do Not Throw Meaningful Incomplete Sequences Away!
Industrial databases often contain a large amount of unfilled information. During the knowledge discovery process one processing step is often necessary in order to remove these ...
Céline Fiot, Anne Laurent, Maguelonne Teiss...
120
Voted
ICDM
2007
IEEE
170views Data Mining» more  ICDM 2007»
15 years 8 months ago
Consensus Clusterings
In this paper we address the problem of combining multiple clusterings without access to the underlying features of the data. This process is known in the literature as clustering...
Nam Nguyen, Rich Caruana
232
Voted
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
16 years 3 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
109
Voted
INFOCOM
2010
IEEE
15 years 27 days ago
Tracking Quantiles of Network Data Streams with Dynamic Operations
— Quantiles are very useful in characterizing the data distribution of an evolving dataset in the process of data mining or network monitoring. The method of Stochastic Approxima...
Jin Cao, Li (Erran) Li, Aiyou Chen, Tian Bu