View : 19 Download: 0

Finding maximal similar paths between XML documents using sequential patterns

Title
Finding maximal similar paths between XML documents using sequential patterns
Authors
Lee J.-W.Park S.-S.
Ewha Authors
박승수이정원
SCOPUS Author ID
박승수scopus
Issue Date
2004
Journal Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN
0302-9743JCR Link
Citation
vol. 3261, pp. 96 - 106
Indexed
SCOPUS WOS scopus
Abstract
Techniques for storing XML documents, optimizing the query, and indexing for XML have been active subjects of research. Most of these techniques are focused on XML documents shared with the same structure (i.e., the same DID or XML Schema). However, when XML documents from the Web or EDMS (Electronic Document Management System) are required to be merged or classified, it is very important to find the common structure among multiple documents for the process of handling documents. In this paper, we propose a new methodology for extracting common structures from XML documents and finding maximal similar paths between structures using sequential pattern mining algorithms. Correct determination of common structures between XML documents provides an important basis for a variety of applications of XML document mining and processing. Experiments with XML documents show that our adapted sequential pattern mining algorithms can find common structures and maximal similar paths between them exactly. © Springer-Verlag 2004.
Appears in Collections:
엘텍공과대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE