Sciweavers

484 search results - page 38 / 97
» Large graph processing in the cloud
Sort
View
77
Voted
ICASSP
2010
IEEE
14 years 8 months ago
Random attributed graphs for statistical inference from content and context
Coping with Information Overload is a major challenge of the 21st century. Huge volumes and varieties of multilingual data must be processed to extract salient information. Previo...
Allen L. Gorin, Carey E. Priebe, John Grothendieck
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
15 years 1 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
15 years 2 months ago
Parallel community detection on large networks with propinquity dynamics
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
Yuzhou Zhang, Jianyong Wang, Yi Wang, Lizhu Zhou
BMCBI
2006
144views more  BMCBI 2006»
14 years 9 months ago
Development and implementation of an algorithm for detection of protein complexes in large interaction networks
Background: After complete sequencing of a number of genomes the focus has now turned to proteomics. Advanced proteomics technologies such as two-hybrid assay, mass spectrometry e...
Md. Altaf-Ul-Amin, Yoko Shinbo, Kenji Mihara, Ken ...
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
15 years 3 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han