Sciweavers

5595 search results - page 686 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
15 years 4 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
SDM
2007
SIAM
109views Data Mining» more  SDM 2007»
15 years 8 months ago
Segmentations with Rearrangements
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
Aristides Gionis, Evimaria Terzi
CLUSTER
2008
IEEE
15 years 8 months ago
Variable-grain and dynamic work generation for Minimal Unique Itemset mining
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
Paraskevas Yiapanis, David J. Haglin, Anna M. Mann...
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
16 years 7 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
CCGRID
2007
IEEE
16 years 1 months ago
Adaptive Performance Modeling on Hierarchical Grid Computing Environments
In the past, efficient parallel algorithms have always been developed specifically for the successive generations of parallel systems (vector machines, shared-memory machines, d...
Wahid Nasri, Luiz Angelo Steffenel, Denis Trystram