172 search results - page 3 / 35 » Independent informative subgraph mining for graph informatio... |
DAWAK
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
KDD
2012
ACM
11 years 7 months ago
2012
ACM
We present TOURVIZ, a system that helps its users to interactively visualize and make sense in large network datasets. In particular, it takes as input a set of nodes the user spe...
NLPRS
2001
Springer
13 years 9 months ago
2001
Springer
This paper presents a Japanese information retrieval method using the dependency relationship between words and semantic and statistical information about them. Our method gives a...
CIKM
2010
Springer
13 years 3 months ago
2010
Springer
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
DCC
2008
IEEE
14 years 5 months ago
2008
IEEE
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...