Sciweavers

222 search results - page 16 / 45
» Experiments with random projections for machine learning
Sort
View
ICCV
2009
IEEE
15 years 16 days ago
Semi-Supervised Random Forests
Random Forests (RFs) have become commonplace in many computer vision applications. Their popularity is mainly driven by their high computational efficiency during both training ...
Christian Leistner, Amir Saffari, Jakob Santner, H...
JCIT
2010
190views more  JCIT 2010»
13 years 2 months ago
Application of Feature Extraction Method in Customer Churn Prediction Based on Random Forest and Transduction
With the development of telecom business, customer churn prediction becomes more and more important. An outstanding issue in customer churn prediction is high dimensional problem....
Yihui Qiu, Hong Li
ECML
2007
Springer
14 years 1 months ago
Structure Learning of Probabilistic Relational Models from Incomplete Relational Data
Abstract. Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn...
Xiao-Lin Li, Zhi-Hua Zhou
ICML
2010
IEEE
13 years 8 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long
COLT
2001
Springer
14 years 1 days ago
Agnostic Boosting
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...
Shai Ben-David, Philip M. Long, Yishay Mansour