Characteristic sets of strings common to semi-structured documents

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

We consider Maximum Agreement Problem which is, given positive and negative documents, to find a characteristic set that matches many of positive documents but rejects many of negative ones. A characteristic set is a sequence (x1., xd) of strings such that each xi is a suffix of xi+1 and all xi’s appear in a document without overlaps. A characteristic set matches semi-structured documents with primitives or user’s defined macros. For example, (“set”,“characteristic set”,“</title> characteristic set”) is a characteristic set extracted from an HTML file. But, an algorithm that solves Maximum Agreement Problem does not output useless characteristic sets, such as those made of only tags of HTML, since such characteristic sets may match most of positive doc- uments but also match most of negative ones. We present an algorithm that, given an integer d which is the number of strings in a characteristic set, solves Maximum Agreement Problem in O(n2 hd) time, where n is the total length of documents and h is the height of the suffix tree of the documents.

Original languageEnglish
Title of host publicationDiscovery Science - 2nd International Conference, DS 1999, Proceedings
EditorsSetsuo Arikawa, Koichi Furukawa
PublisherSpringer Verlag
Pages139-147
Number of pages9
ISBN (Print)354066713X, 9783540667131
DOIs
Publication statusPublished - Jan 1 1999
Event2nd International Conference on Discovery Science, DS 1999 - Tokyo, Japan
Duration: Dec 6 1999Dec 8 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1721
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Conference on Discovery Science, DS 1999
CountryJapan
CityTokyo
Period12/6/9912/8/99

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Characteristic sets of strings common to semi-structured documents'. Together they form a unique fingerprint.

Cite this