Sciweavers

2822 search results - page 263 / 565
» Mining Optimized Ranges
Sort
View
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
15 years 5 months ago
Laplacian Spectrum Learning
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
Pannagadatta K. Shivaswamy, Tony Jebara
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
15 years 4 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
15 years 4 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König
ICDM
2010
IEEE
142views Data Mining» more  ICDM 2010»
15 years 4 months ago
Towards Community Discovery in Signed Collaborative Interaction Networks
Abstract--We propose a framework for discovery of collaborative community structure in Wiki-based knowledge repositories based on raw-content generation analysis. We leverage topic...
Petko Bogdanov, Nicholas D. Larusso, Ambuj K. Sing...
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
15 years 4 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...