Sciweavers

701 search results - page 94 / 141
» Visual Data Mining and Machine Learning
Sort
View
ECML
2006
Springer
13 years 10 months ago
B-Matching for Spectral Clustering
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
Tony Jebara, Vlad Shchogolev
ICCV
2007
IEEE
14 years 2 months ago
Contextual Distance for Data Perception
Structural perception of data plays a fundamental role in pattern analysis and machine learning. In this paper, we develop a new structural perception of data based on local conte...
Deli Zhao, Zhouchen Lin, Xiaoou Tang
ICML
2010
IEEE
13 years 9 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
INFORMS
2007
123views more  INFORMS 2007»
13 years 8 months ago
Constructing Ensembles from Data Envelopment Analysis
It has been shown in prior work in management science, statistics and machine learning that using an ensemble of models often results in better performance than using a single ‘...
Zhiqiang Zheng, Balaji Padmanabhan
ECML
2004
Springer
14 years 1 months ago
Improving Random Forests
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
Marko Robnik-Sikonja