Sciweavers

807 search results - page 2 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
14 years 5 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
JCB
2000
87views more  JCB 2000»
13 years 5 months ago
Comparison of Additive Trees Using Circular Orders
It has been postulated that existing species have been linked in the past in a way that can be described using an additive tree structure. Any such tree structure reflecting speci...
Vladimir Makarenkov, Bruno Leclerc
APVIS
2004
13 years 6 months ago
Optimal Leaf Ordering for Two and a Half Dimensional Phylogenetic Tree Visualisation
Two and a half dimensional graph visualisation is the stacking of a set of related graphs into the third dimension to support visual comparison. A new aesthetic criterion is intro...
Tim Dwyer, Falk Schreiber
CORR
2010
Springer
427views Education» more  CORR 2010»
13 years 3 months ago
A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algori
Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent charact...
Poonam Garg
ALT
2003
Springer
13 years 9 months ago
Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumot...