Sciweavers

4114 search results - page 680 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
WWW
2009
ACM
14 years 9 months ago
Fast dynamic reranking in large graphs
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
Purnamrita Sarkar, Andrew W. Moore
WWW
2006
ACM
14 years 9 months ago
Probabilistic models for discovering e-communities
The increasing amount of communication between individuals in e-formats (e.g. email, Instant messaging and the Web) has motivated computational research in social network analysis...
Ding Zhou, Eren Manavoglu, Jia Li, C. Lee Giles, H...
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 9 months ago
GraphScope: parameter-free mining of large time-evolving graphs
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
Jimeng Sun, Christos Faloutsos, Spiros Papadimitri...
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
14 years 9 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou
KDD
2004
ACM
151views Data Mining» more  KDD 2004»
14 years 9 months ago
Feature selection in scientific applications
Numerous applications of data mining to scientific data involve the induction of a classification model. In many cases, the collection of data is not performed with this task in m...
Erick Cantú-Paz, Shawn Newsam, Chandrika Ka...