Please use this identifier to cite or link to this item:
Title: Frequent closed pattern search by row and feature enumerations
Authors: PAN FENG
Keywords: enumeration tree, frequent closed pattern, transposed table
Issue Date: 14-Apr-2004
Source: PAN FENG (2004-04-14). Frequent closed pattern search by row and feature enumerations. ScholarBank@NUS Repository.
Abstract: The growth of bioinformatics has resulted in datasets with new characteristics. These datasets contain a large number of columns and a small number of rows. For example, many gene expression datasets can contain up to 10,000-100,000 columns but only have 100-300 rows.Such datasets pose a great challenge for existing frequent pattern discovery algorithms, since they have an exponential dependence on the average row length. In this thesis, we first describe an algorithm called CARPENTER that is designed to handle datasets having a large number of attributes and relatively small number of rows.With the development of CARPENTER algorithm, existing algorithms can presently be separated into two groups, feature (column) enumeration and row enumeration. Then in the second part of this thesis, we describe another algorithm called COBBLER which is designed to dynamically switch between feature and row enumeration depending on the data characteristic in the process of mining.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
thesis_panfeng_HT026416N.pdf540.18 kBAdobe PDF



Page view(s)

checked on Jan 22, 2018


checked on Jan 22, 2018

Google ScholarTM


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