Sciweavers

2227 search results - page 343 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
128
Voted
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 3 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
IPMI
2009
Springer
15 years 7 months ago
Dense Registration with Deformation Priors
Abstract. In this paper we propose a novel approach to define task-driven regularization constraints in deformable image registration using learned deformation priors. Our method ...
Ben Glocker, Nikos Komodakis, Nassir Navab, Georgi...
IADIS
2003
15 years 4 months ago
Query-Based Discovering of Popular Changes in WWW
This paper presents the method for retrieving and summarizing changes in topics from online resources. Users often want to know what are the major changes in their areas of intere...
Adam Jatowt, Khoo Khyou Bun, Mitsuru Ishizuka
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
16 years 10 days ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
ICDCS
2006
IEEE
15 years 9 months ago
ParRescue: Scalable Parallel Algorithm and Implementation for Biclustering over Large Distributed Datasets
Biclustering refers to simultaneously capturing correlations present among subsets of attributes (columns) and records (rows). It is widely used in data mining applications includ...
Jianhong Zhou, Ashfaq A. Khokhar