An Improved Rectangular Decomposition Algorithm for Data Mining 


Vol. 10,  No. 3, pp. 265-272, Jun.  2003
10.3745/KIPSTB.2003.10.3.265


PDF
  Abstract

In this paper, we propose a novel improved algorithm for the rectangular decomposition technique for the purpose of performing data mining from large scaled database in a dynamic environment. The proposed algorithm performs the rectangular decompositions by transforming a binary matrix to bipartite graph and finding bicliques from the transformed bipartite graph. To demonstrate its effectiveness, we compare the proposed one which is based on the newly derived mathematical properties with those of other methods with respect to the classification rate, the number of rules, and complexity analysis.

  Statistics
  Cite this article

[IEEE Style]

J. Y. Song, Y. H. Im, D. H. Park, "An Improved Rectangular Decomposition Algorithm for Data Mining," The KIPS Transactions:PartB , vol. 10, no. 3, pp. 265-272, 2003. DOI: 10.3745/KIPSTB.2003.10.3.265.

[ACM Style]

Ji Young Song, Young Hee Im, and Dai Hee Park. 2003. An Improved Rectangular Decomposition Algorithm for Data Mining. The KIPS Transactions:PartB , 10, 3, (2003), 265-272. DOI: 10.3745/KIPSTB.2003.10.3.265.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals