37 search results - page 6 / 8 » Discovering Large Dense Subgraphs in Massive Graphs |
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
IJMMS
2007
13 years 7 months ago
2007
What does a ‘normal’ computer (or social) network look like? How can we spot ‘abnormal’ sub-networks in the Internet, or web graph? The answer to such questions is vital f...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
KDD
2005
ACM
14 years 1 months ago
2005
ACM
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...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
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...