Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 30 November 2009

Optimizing Feature Construction Process for Dynamic Aggregation of Relational Attributes

Rayner Alfred

Journal of Computer Science, Volume 5, Issue 11, pp. 864–877 · doi.org/10.3844/jcssp.2009.864.877

6,929 accesses4,409 downloads18 citations (Crossref)Metrics
Cite Check for updates

Abstract

Problem statement: The importance of input representation has been recognized already in machine learning. Feature construction is one of the methods used to generate relevant features for learning data. This study addressed the question whether or not the descriptive accuracy of the DARA algorithm benefits from the feature construction process. In other words, this paper discusses the application of genetic algorithm to optimize the feature construction process to generate input data for the data summarization method called Dynamic Aggregation of Relational Attributes (DARA). Approach: The DARA algorithm was designed to summarize data stored in the non-target tables by clustering them into groups, where multiple records stored in non-target tables correspond to a single record stored in a target table. Here, feature construction methods are applied in order to improve the descriptive accuracy of the DARA algorithm. Since, the study addressed the question whether or not the descriptive accuracy of the DARA algorithm benefits from the feature construction process, the involved task includes solving the problem of constructing a relevant set of features for the DARA algorithm by using a genetic-based algorithm. Results: It is shown in the experimental results that the quality of summarized data is directly influenced by the methods used to create patterns that represent records in the (n×p) TF-IDF weighted frequency matrix. The results of the evaluation of the genetic-based feature construction algorithm showed that the data summarization results can be improved by constructing features by using the Cluster Entropy (CE) genetic-based feature construction algorithm. Conclusion: This study showed that the data summarization results can be improved by constructing features by using the cluster entropy genetic-based feature construction algorithm.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2009 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Alfred, R. (2009). Optimizing Feature Construction Process for Dynamic Aggregation of Relational Attributes. Journal of Computer Science, 5(11), 864–877. https://doi.org/10.3844/jcssp.2009.864.877

Licence
© Science Publications
Issue
Volume 5, Issue 11
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Optimizing Feature Construction Process for Dynamic Aggregation of Relational AttributesJournal of Computer Science · Volume 5, Issue 11 · pp. 864–877 · © Science PublicationsDownload