Information Extraction by XLM

Authors:
Masashi Okada;Naohiro Ishii;Nariaki Kato
Affiliations:
Aichi Institute of Technology, Yachigusa, Yakusacho, Toyota, Japan 470-0392, Japan;Aichi Institute of Technology, Yachigusa, Yakusacho, Toyota, Japan 470-0392, Japan;Aichi Institute of Technology, Yachigusa, Yakusacho, Toyota, Japan 470-0392, Japan
Venue:
KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
Year:
2007

Citing 6
Cited 0

Indexing and Mining Free Trees

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
XRules: an effective structural classifier for XML data

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications

IEEE Transactions on Knowledge and Data Engineering
Text Classification by Combining Different Distance Functions withWeights

SNPD-SAWN '06 Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Classification by instance-based learning algorithm

IDEAL'05 Proceedings of the 6th international conference on Intelligent Data Engineering and Automated Learning
Efficiently Mining Frequent Embedded Unordered Trees

Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences

Quantified Score

Hi-index	0.00

Visualization

Abstract

XML(eXtensible Markup Language) is used as the description form of the documents and the data exchanged on the Web. Now, the usage of the XML is extending to not only the exchange of the XML document but also that of the XML database for classification and retrieval. This paper develops how to retrieve the related objective data from the tree structure in the XML document for the classification. In this paper, an ordered preserving relation is defined as the cue of the retrieval of the objective pattern. Then, the problem is to find the ordered preserving relations in the document. In the document, the ordered and the unordered subtree structure are important in the retrieval and classification. Then, the retrieval value is calculated in the tree structure. A method developed here was applied to the practical XML document.