Mining rooted ordered trees under subtree homeomorphism

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Data mining and knowledge discovery

• Publication date

  2014-12-03

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10618-015-0439-5
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Scaling Up Machine Learning: Mining Tree-Structured Data on Multicore Systems

  2011cited by this paper
• OInduced: An Efficient Algorithm for Mining Induced Patterns From Rooted Ordered Trees

  2011cited by this paper
• Efficiently Mining Unordered Trees

  2011cited by this paper
• Mining frequent closed rooted trees

  2009cited by this paper
• Tree model guided candidate generation for mining frequent subtrees from XML documents

  2008cited by this paper
• Fast Matching of Twig Patterns

  2008cited by this paper
• TwigList : Make Twig Pattern Matching Fast

  2007cited by this paper
• Responsible editor: Hannu Toivonen.

  2007cited by this paper
• TRIPS and TIDES: new algorithms for tree mining

  2006influential reference
• Frequent Pattern Mining in Web Log Data

  2006cited by this paper
• The tree inclusion problem: In linear space and faster

  2006cited by this paper
• XRules: An effective algorithm for structural classification of XML data

  2006cited by this paper
• Efficiently mining frequent trees in a forest: algorithms and applications

  2005influential reference
• Discovering Frequent Embedded Subtree Patterns from Large Databases of Unordered Labeled Trees

  2005cited by this paper
• Discovery of Maximally Frequent Tag Tree Patterns with Height-Constrained Variables from Semistructured Web Documents

  2005cited by this paper
• CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees

  2004cited by this paper
• Efficient Pattern-Growth Methods for Frequent Tree Pattern Mining

  2004cited by this paper
• GREW - a scalable frequent subgraph discovery algorithm

  2004cited by this paper
• Efficiently Mining Frequent Embedded Unordered Trees

  2004cited by this paper
• 2PXMiner: an efficient two pass mining of frequent XML query patterns

  2004cited by this paper
• Frequent Subtree Mining – An Overview

  2004cited by this paper
• Discovery of Maximally Frequent Tag Tree Patterns with Contractible Variables from Semistructured Documents

  2004cited by this paper
• On the topology of multicast trees

  2003influential reference
• Efficient discovery of frequent unordered trees

  2003cited by this paper
• Indexing and mining free trees

  2003cited by this paper
• Efficient data mining for maximal frequent subtrees

  2003cited by this paper
• CloseGraph: mining closed frequent graph patterns

  2003cited by this paper
• Algorithmics and applications of tree and graph searching

  2002cited by this paper
• ATreeGrep: approximate searching in unordered trees

  2002cited by this paper
• Aggregated Multicast – A Comparative Study

  2002cited by this paper
• SEuS: Structure Extraction Using Summaries

  2002cited by this paper
• Modeling the branching characteristics and efficiency gains in global multicast trees

  2001cited by this paper
• Efficient Substructure Discovery from Large Semi-Structured Data

  2001cited by this paper
• Frequent subgraph discovery

  2001cited by this paper
• Discovering Structural Association of Semistructured Data

  2000cited by this paper
• An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data

  2000cited by this paper
• Discovering typical structures of documents: a road map approach

  1998cited by this paper
• Mining Association Rules in Multiple Relations

  1997cited by this paper
• Verkamo: Fast Discovery of Association Rules

  1996cited by this paper
• Ordered and Unordered Tree Inclusion

  1995cited by this paper
• On the complexity of finding iso- and other morphisms for partial k-trees

  1992cited by this paper
• Maintaining order in a linked list

  1982influential reference

• Mining transactional tree databases under homeomorphism

  2025cites this paper
• A Review on the Impact of Data Representation on Model Explainability

  2024cites this paper
• Optimum maintenance units in multi‐indenture systems

  2024cites this paper
• Non-uniform Sampling Methods for Large Itemset Mining

  2023cites this paper
• The Embeddings World and Artificial General Intelligence

  2022cites this paper
• On using affine sketches for multiple-response dynamic graph regression

  2022cites this paper
• Subsampled Randomized Hadamard Transform for Regression of Dynamic Graphs

  2020cites this paper
• Sampling informative patterns from large single networks

  2020cites this paper
• Dynamical algorithms for data mining and machine learning over dynamic graphs

  2020cites this paper
• On the theory of dynamic graph regression problem

  2019cites this paper
• Sublinear update time randomized algorithms for dynamic graph regression

  2019cites this paper
• Regression and Singular Value Decomposition in Dynamic Graphs

  2019cites this paper
• Efficient Discovery of Embedded Patterns from Large Attributed Trees

  2018cites this paper
• From Homomorphisms to Embeddings: A Novel Approach for Mining Embedded Patterns from Large Tree Data

  2018cites this paper
• An Anomaly Recognition and Autonomic Optimization Method to User’s Sequence Behaviors for D2D Communications in MCC

  2018cites this paper
• Taxonomic Superimposed Tree and Graph Mining Algorithms: A Comprehensive Study

  2017cites this paper
• Transactional Tree Mining

  2016cites this paper