Sciweavers

324 search results - page 63 / 65
» Scalability of Databases for Digital Libraries
Sort
View
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 10 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
14 years 10 months ago
SNARE: a link analytic system for graph labeling and risk detection
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
Mary McGlohon, Stephen Bay, Markus G. Anderle, Dav...
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
14 years 10 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 10 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 10 months ago
Cleaning disguised missing data: a heuristic approach
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
Ming Hua, Jian Pei