Sciweavers

34 search results - page 4 / 7
» Finding maximal k-edge-connected subgraphs from a large grap...
Sort
View
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
13 years 6 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang
SDM
2009
SIAM
192views Data Mining» more  SDM 2009»
14 years 3 months ago
Mining Cohesive Patterns from Graphs with Feature Vectors.
The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to g...
Arash Rafiey, Flavia Moser, Martin Ester, Recep Co...
CIKM
2009
Springer
13 years 9 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
IPPS
2010
IEEE
13 years 3 months ago
Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
Seunghwa Kang, David A. Bader
DILS
2006
Springer
13 years 9 months ago
Link Discovery in Graphs Derived from Biological Databases
Public biological databases contain vast amounts of rich data that can also be used to create and evaluate new biological hypothesis. We propose a method for link discovery in biol...
Petteri Sevon, Lauri Eronen, Petteri Hintsanen, Ki...