2004 | OriginalPaper | Buchkapitel
Discovering Maximal Frequent Patterns in Sequence Groups
verfasst von : J. W. Guan, David A. Bell, Dayou Liu
Erschienen in: Rough Sets and Current Trends in Computing
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper, we give a general treatment for some kind of sequences such as customer sequences, document sequences, and DNA sequences, etc. Large collections of transaction, document, and genomic information have been accumulated in recent years, and embedded latently in it there is potentially significant knowledge for exploitation in the retailing industry, in information retrieval, in medicine and in the pharmaceutical industry, respectively. The approach taken here to the distillation of such knowledge is to detect strings in sequences which appear frequently, either within a given sequence (eg for a particular customer, document, or patient) or across sequences (eg from different customers, documents, or patients sharing a particular transaction, information retrieval, or medical diagnosis; respectively).