Sciweavers

115 search results - page 6 / 23
» Scalable Discovery of Best Clusters on Large Graphs
Sort
View
IM
2008
13 years 7 months ago
Finding Strongly Knit Clusters in Social Networks
Social networks are ubiquitous. The discovery of close-knit clusters in these networks is of fundamental and practical interest. Existing clustering criteria are limited in that c...
Nina Mishra, Robert Schreiber, Isabelle Stanton, R...
PVLDB
2010
146views more  PVLDB 2010»
13 years 2 months ago
HaLoop: Efficient Iterative Data Processing on Large Clusters
The growing demand for large-scale data mining and data analysis applications has led both industry and academia to design new types of highly scalable data-intensive computing pl...
Yingyi Bu, Bill Howe, Magdalena Balazinska, Michae...
HICSS
2008
IEEE
114views Biometrics» more  HICSS 2008»
14 years 1 months ago
On Structural Analysis of Large Networks
Containing much valuable information, networks such as the World Wide Web, social networks and metabolic networks draw increasingly attention in scientific communities. Network cl...
Nurcan Yuruk, Xiaowei Xu, Thomas A. J. Schweiger
KDD
2002
ACM
138views Data Mining» more  KDD 2002»
14 years 7 months ago
Learning to match and cluster large high-dimensional data sets for data integration
Part of the process of data integration is determining which sets of identifiers refer to the same real-world entities. In integrating databases found on the Web or obtained by us...
William W. Cohen, Jacob Richman
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
13 years 5 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima