Presentation 1999/3/24
A Deciding Algorithm Whether a Given Database Is Cyclic
Kotaro Nonaka, Ryuichi Nakanishi, Minoru Ito, Michio Nakanishi,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we propose a deciding algorithm whether a given database is cyclic. A cyclic database is partitioned into the databases of each time slice (month, week, day, etc.), and the databases of a same period (January, the 1st week of May, Thanks giving Day, etc.) are similar. Previously, we have proposed the efficient data mining algorithm for the cyclic database. In this paper, we propose an algorithm to decide whether a given database is cyclic in time polynomial of the size of a database.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) data mining / cyclic database / large itemset / computational complexity / database
Paper # COMP-98-88
Date of Issue

Conference Information
Committee COMP
Conference Date 1999/3/24(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Deciding Algorithm Whether a Given Database Is Cyclic
Sub Title (in English)
Keyword(1) data mining
Keyword(2) cyclic database
Keyword(3) large itemset
Keyword(4) computational complexity
Keyword(5) database
1st Author's Name Kotaro Nonaka
1st Author's Affiliation Graduate School of Information Science, Nara Institute of Science and Technology()
2nd Author's Name Ryuichi Nakanishi
2nd Author's Affiliation Graduate School of Information Science, Nara Institute of Science and Technology
3rd Author's Name Minoru Ito
3rd Author's Affiliation Graduate School of Information Science, Nara Institute of Science and Technology
4th Author's Name Michio Nakanishi
4th Author's Affiliation Education Center for Information Processing, Osaka University
Date 1999/3/24
Paper # COMP-98-88
Volume (vol) vol.98
Number (no) 685
Page pp.pp.-
#Pages 7
Date of Issue