Sciweavers

20294 search results - page 131 / 4059
» Algorithmic Information Theory
Sort
View
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
15 years 5 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
134
Voted
WWW
2005
ACM
16 years 5 months ago
Predictive ranking: a novel page ranking approach by estimating the web structure
PageRank (PR) is one of the most popular ways to rank web pages. However, as the Web continues to grow in volume, it is becoming more and more difficult to crawl all the available...
Haixuan Yang, Irwin King, Michael R. Lyu
KDD
2009
ACM
169views Data Mining» more  KDD 2009»
15 years 11 months ago
On burstiness-aware search for document sequences
As the number and size of large timestamped collections (e.g. sequences of digitized newspapers, periodicals, blogs) increase, the problem of efficiently indexing and searching su...
Theodoros Lappas, Benjamin Arai, Manolis Platakis,...
GIAE
2004
Springer
159views Mathematics» more  GIAE 2004»
15 years 9 months ago
A Survey of Moving Frames
This paper surveys the new, algorithmic theory of moving frames developed by the author and M. Fels. Applications in geometry, computer vision, classical invariant theory, the cal...
Peter J. Olver
CHI
2001
ACM
16 years 4 months ago
Visual information foraging in a focus + context visualization
Eye tracking studies of the Hyperbolic Tree browser [10] suggest that visual search in focus+context displays is highly affected by information scent (i.e., local cues, such as te...
Peter Pirolli, Stuart K. Card, Mija M. Van Der Weg...