Sciweavers

1213 search results - page 182 / 243
» Approximation in quantale-enriched categories
Sort
View
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
15 years 10 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
KDD
2006
ACM
159views Data Mining» more  KDD 2006»
15 years 10 months ago
Global distance-based segmentation of trajectories
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
Aris Anagnostopoulos, Michail Vlachos, Marios Hadj...
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
15 years 10 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
15 years 10 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
15 years 10 months ago
Tensor-CUR decompositions for tensor-based data
Motivated by numerous applications in which the data may be modeled by a variable subscripted by three or more indices, we develop a tensor-based extension of the matrix CUR decom...
Michael W. Mahoney, Mauro Maggioni, Petros Drineas