XRules: an effective structural classifier for XML data
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Frequent free tree discovery in graph data
Proceedings of the 2004 ACM symposium on Applied computing
XML-Based Meta-Retrieval of Networked Data Sources
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Finding hot query patterns over an XQuery stream
The VLDB Journal — The International Journal on Very Large Data Bases
Bayesian network model for semi-structured document classification
Information Processing and Management: an International Journal - Special issue: Bayesian networks and information retrieval
Knowledge Discovery from Transportation Network Data
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Web data extraction based on structural similarity
Knowledge and Information Systems
Exploit sequencing to accelerate hot XML query pattern mining
Proceedings of the 2006 ACM symposium on Applied computing
Data & Knowledge Engineering - Special issue: WIDM 2004
Efficiently Mining Frequent Embedded Unordered Trees
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Detecting Irrelevant Subtrees to Improve Probabilistic Learning from Tree-structured Data
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
XML structural delta mining: issues and challenges
Data & Knowledge Engineering - Special issue: ER 2003
Xproj: a framework for projected structural clustering of xml documents
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient mining of XML query patterns for caching
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient mining of frequent XML query patterns with repeating-siblings
Information and Software Technology
An XML-enabled data mining query language: XML-DMQL
International Journal of Business Intelligence and Data Mining
Efficient mining of frequent closed XML query pattern
Journal of Computer Science and Technology
Tree model guided candidate generation for mining frequent subtrees from XML documents
ACM Transactions on Knowledge Discovery from Data (TKDD)
PCITMiner: prefix-based closed induced tree miner for finding closed induced frequent subtrees
AusDM '07 Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70
Fuzzy Tree Mining: Go Soft on Your Nodes
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
Combining Web Usage Mining and XML Mining in a Real Case Study
From Web to Social Web: Discovering and Deploying User and Content Profiles
Discovery of Useful Patterns from Tree-Structured Documents with Label-Projected Database
ATC '08 Proceedings of the 5th international conference on Autonomic and Trusted Computing
An integrated, generic approach to pattern mining: data mining template library
Data Mining and Knowledge Discovery
U3 - Mning Unordered Embedded Subtrees Using TMG Candidate Generation
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
An Experimental Comparison of Different Inclusion Relations in Frequent Tree Mining
Fundamenta Informaticae - Progress on Multi-Relational Data Mining
Incremental sequence-based frequent query pattern mining from XML queries
Data Mining and Knowledge Discovery
Matching subsequences in trees
Journal of Discrete Algorithms
FTMnodes: Fuzzy tree mining based on partial inclusion
Fuzzy Sets and Systems
Discovering unexpected documents in corpora
Knowledge-Based Systems
Tree mining: Equivalence classes for candidate generation
Intelligent Data Analysis
Mining induced and embedded subtrees in ordered, unordered, and partially-ordered trees
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Efficient algorithms for mining frequent and closed patterns from semi-structured data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Mining maximal frequent subtrees with lists-based pattern-growth method
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
A weighted common structure based clustering technique for XML documents
Journal of Systems and Software
Full duplicate candidate pruning for frequent connected subgraph mining
Integrated Computer-Aided Engineering
POTMiner: mining ordered, unordered, and partially-ordered trees
Knowledge and Information Systems
Frequent tree pattern mining: A survey
Intelligent Data Analysis
Model guided algorithm for mining unordered embedded subtrees
Web Intelligence and Agent Systems
Improving constrained pattern mining with first-fail-based heuristics
Data Mining and Knowledge Discovery
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
Efficient subtree inclusion testing in subtree discovering applications
SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization
Clust-XPaths: clustering of XML paths
MLDM'11 Proceedings of the 7th international conference on Machine learning and data mining in pattern recognition
WSEAS Transactions on Computers
A new sequential mining approach to XML document clustering*
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
IMB3-Miner: mining induced/embedded subtrees by constraining the level of embedding
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
EFoX: a scalable method for extracting frequent subtrees
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Clustering XML documents by structure based on common neighbor
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
A flexible structured-based representation for XML document mining
INEX'05 Proceedings of the 4th international conference on Initiative for the Evaluation of XML Retrieval
Sequential pattern mining for structure-based XML document classification
INEX'05 Proceedings of the 4th international conference on Initiative for the Evaluation of XML Retrieval
Transforming XML trees for efficient classification and clustering
INEX'05 Proceedings of the 4th international conference on Initiative for the Evaluation of XML Retrieval
Clustering and retrieval of XML documents by structure
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
EXiT-B: a new approach for extracting maximal frequent subtrees from XML data
IDEAL'05 Proceedings of the 6th international conference on Intelligent Data Engineering and Automated Learning
Extraction of interesting financial information from heterogeneous XML-Based data
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Matching subsequences in trees
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
To see the wood for the trees: mining frequent tree patterns
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
An output-polynomial time algorithm for mining frequent closed attribute trees
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
WISE'06 Proceedings of the 7th international conference on Web Information Systems
Mining frequent association tag sequences for clustering XML documents
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
An Experimental Comparison of Different Inclusion Relations in Frequent Tree Mining
Fundamenta Informaticae - Progress on Multi-Relational Data Mining
Efficiently Mining Frequent Embedded Unordered Trees
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Detecting Irrelevant Subtrees to Improve Probabilistic Learning from Tree-structured Data
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Mining Induced/Embedded Subtrees using the Level of Embedding Constraint
Fundamenta Informaticae
| Hi-index | 0.00 |
In this paper, we consider the problem of searching fre-quenttrees from a collection of tree-structured data model-ingXML data. The TreeF inder algorithm aims at findingtrees, such that their exact or perturbed copies are frequentin a collection of labelled trees.To cope with complexity issues, TreeF inder is correctbut not complete: it finds a subset of the actually frequenttrees. The default of completeness is experimentally inves-tigatedon artificial medium size datasets; it is shown thatTreeFinderreaches completeness or falls short to it for arange of experimental settings.