Sciweavers

574 search results - page 36 / 115
» Maximum Margin Clustering
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 8 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
ICML
2005
IEEE
14 years 8 months ago
Predicting good probabilities with supervised learning
We examine the relationship between the predictions made by different learning algorithms and true posterior probabilities. We show that maximum margin methods such as boosted tre...
Alexandru Niculescu-Mizil, Rich Caruana
CORR
2008
Springer
70views Education» more  CORR 2008»
13 years 7 months ago
Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes
This paper deals with the problem of universal lossless coding on a countable infinite alphabet. It focuses on some classes of sources defined by an envelope condition on the margi...
Dominique Bontemps
BROADNETS
2004
IEEE
13 years 11 months ago
Design and Analysis of a Fast Local Clustering Service for Wireless Sensor Networks
We present a fast local clustering service, FLOC, that partitions a multi-hop wireless network into nonoverlapping and approximately equal-sized clusters. Each cluster has a clust...
Murat Demirbas, Anish Arora, Vineet Mittal, Vinod ...
INFORMATICALT
2002
136views more  INFORMATICALT 2002»
13 years 7 months ago
Comparison of Poisson Mixture Models for Count Data Clusterization
Abstract. Five methods for count data clusterization based on Poisson mixture models are described. Two of them are parametric, the others are semi-parametric. The methods emlploy ...
Jurgis Susinskas, Marijus Radavicius