Sciweavers

3949 search results - page 580 / 790
» Machine Learning and Data Mining
Sort
View
ICML
2006
IEEE
16 years 3 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford
ICML
2010
IEEE
15 years 7 months ago
Variable Selection in Model-Based Clustering: To Do or To Facilitate
Variable selection for cluster analysis is a difficult problem. The difficulty originates not only from the lack of class information but also the fact that high-dimensional data ...
Leonard K. M. Poon, Nevin Lianwen Zhang, Tao Chen,...
KES
2006
Springer
15 years 6 months ago
The Repository Method for Chance Discovery in Financial Forecasting
Abstract. The aim of this work is to forecast future events in financial data sets, in particular, we focus our attention on situations where positive instances are rare, which fal...
Alma Lilia Garcia-Almanza, Edward P. K. Tsang
SIGMOD
2009
ACM
185views Database» more  SIGMOD 2009»
16 years 6 months ago
Attacks on privacy and deFinetti's theorem
In this paper we present a method for reasoning about privacy using the concepts of exchangeability and deFinetti's theorem. We illustrate the usefulness of this technique by...
Daniel Kifer
ECML
2007
Springer
16 years 20 days ago
Spectral Clustering and Embedding with Hidden Markov Models
Abstract. Clustering has recently enjoyed progress via spectral methods which group data using only pairwise affinities and avoid parametric assumptions. While spectral clustering ...
Tony Jebara, Yingbo Song, Kapil Thadani