Sciweavers

860 search results - page 89 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
KDD
2008
ACM
134views Data Mining» more  KDD 2008»
14 years 8 months ago
Privacy-preserving cox regression for survival analysis
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
Shipeng Yu, Glenn Fung, Rómer Rosales, Srir...
COLT
2005
Springer
14 years 1 months ago
A PAC-Style Model for Learning from Labeled and Unlabeled Data
Abstract. There has been growing interest in practice in using unlabeled data together with labeled data in machine learning, and a number of different approaches have been develo...
Maria-Florina Balcan, Avrim Blum
GECCO
2009
Springer
110views Optimization» more  GECCO 2009»
14 years 13 days ago
EMO shines a light on the holes of complexity space
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
Núria Macià, Albert Orriols-Puig, Es...
EDBT
2004
ACM
192views Database» more  EDBT 2004»
14 years 8 months ago
LIMBO: Scalable Clustering of Categorical Data
Abstract. Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, ...
Periklis Andritsos, Panayiotis Tsaparas, Ren&eacut...
PAMI
2007
166views more  PAMI 2007»
13 years 7 months ago
A Comparison of Decision Tree Ensemble Creation Techniques
Abstract—We experimentally evaluate bagging and seven other randomizationbased approaches to creating an ensemble of decision tree classifiers. Statistical tests were performed o...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...