Sciweavers

3786 search results - page 366 / 758
» Structure Comparison and Structure Patterns
Sort
View
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 5 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
16 years 5 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki

Publication
583views
16 years 2 months ago
A Camera flash based projector system for true scale metric reconstruction
Computer vision techniques have been applied for rapid and accurate structure recovery in many fields. Most methods perform poorly in areas containing little or no texture and i...
Rohith MV, Gowri Somanath, Debra Norris, Jennifer ...
IPPS
2008
IEEE
15 years 11 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
GBRPR
2007
Springer
15 years 11 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke