Sciweavers

JMLR
2006
206views more  JMLR 2006»
13 years 5 months ago
New Algorithms for Efficient High-Dimensional Nonparametric Classification
This paper is about non-approximate acceleration of high-dimensional nonparametric operations such as k nearest neighbor classifiers. We attempt to exploit the fact that even if w...
Ting Liu, Andrew W. Moore, Alexander G. Gray
IJDMB
2008
132views more  IJDMB 2008»
13 years 5 months ago
A Bayesian framework for knowledge driven regression model in micro-array data analysis
: This paper addresses the sparse data problem in the linear regression model, namely the number of variables is significantly larger than the number of the data points for regress...
Rong Jin, Luo Si, Christina Chan
DATAMINE
2006
166views more  DATAMINE 2006»
13 years 5 months ago
Accelerated EM-based clustering of large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
Jakob J. Verbeek, Jan Nunnink, Nikos A. Vlassis
CLASSIFICATION
2008
111views more  CLASSIFICATION 2008»
13 years 5 months ago
Probabilistic D-Clustering
: We present a new iterative method for probabilistic clustering of data. Given clusters, their centers and the distances of data points from these centers, the probability of clus...
Adi Ben-Israel, Cem Iyigun
CAGD
2008
112views more  CAGD 2008»
13 years 5 months ago
On the approximation order of tangent estimators
A classic problem in geometric modelling is curve interpolation to data points. Some of the existing interpolation schemes only require point data, whereas others, require higher ...
G. Albrecht, J.-P. Bécar, Gerald E. Farin, ...
ICML
2010
IEEE
13 years 5 months ago
Nonparametric Information Theoretic Clustering Algorithm
In this paper we propose a novel clustering algorithm based on maximizing the mutual information between data points and clusters. Unlike previous methods, we neither assume the d...
Lev Faivishevsky, Jacob Goldberger
ECAI
2010
Springer
13 years 6 months ago
A Very Fast Method for Clustering Big Text Datasets
Large-scale text datasets have long eluded a family of particularly elegant and effective clustering methods that exploits the power of pair-wise similarities between data points ...
Frank Lin, William W. Cohen
NIPS
2000
13 years 6 months ago
A Support Vector Method for Clustering
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
Asa Ben-Hur, David Horn, Hava T. Siegelmann, Vladi...
CATE
2004
190views Education» more  CATE 2004»
13 years 6 months ago
Enhancing Online Learning Performance: An Application of Data Mining Methods
Recently web-based educational systems collect vast amounts of data on user patterns, and data mining methods can be applied to these databases to discover interesting associations...
Behrouz Minaei-Bidgoli, Gerd Kortemeyer, William F...
AAAI
2006
13 years 6 months ago
An Efficient Algorithm for Local Distance Metric Learning
Learning application-specific distance metrics from labeled data is critical for both statistical classification and information retrieval. Most of the earlier work in this area h...
Liu Yang, Rong Jin, Rahul Sukthankar, Yi Liu