Sciweavers

2801 search results - page 372 / 561
» On the Adequateness of the Connection Method
Sort
View
ICML
2009
IEEE
16 years 7 months ago
On primal and dual sparsity of Markov networks
Sparsity is a desirable property in high dimensional learning. The 1-norm regularization can lead to primal sparsity, while max-margin methods achieve dual sparsity. Combining the...
Jun Zhu, Eric P. Xing
ICML
2006
IEEE
16 years 7 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
KDD
2008
ACM
155views Data Mining» more  KDD 2008»
16 years 7 months ago
Factorization meets the neighborhood: a multifaceted collaborative filtering model
Recommender systems provide users with personalized suggestions for products or services. These systems often rely on Collaborating Filtering (CF), where past transactions are ana...
Yehuda Koren
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
16 years 7 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
16 years 7 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren