Sciweavers

731 search results - page 5 / 147
» Taxonomy-superimposed graph mining
Sort
View
ICDM
2009
IEEE
139views Data Mining» more  ICDM 2009»
13 years 5 months ago
Frequent Pattern Discovery from a Single Graph with Quantitative Itemsets
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
Yuuki Miyoshi, Tomonobu Ozaki, Takenao Ohkawa
EDBT
2008
ACM
160views Database» more  EDBT 2008»
13 years 9 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu
DCC
2008
IEEE
14 years 7 months ago
An Approach to Graph and Netlist Compression
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 ...
Jeehong Yang, Serap A. Savari, Oskar Mencer
DIS
2007
Springer
13 years 11 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
13 years 5 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu