Cover Image

The discovery of Top-K DNA frequent patterns with approximate method / Nittaya Kerdprasop and Kittisak Kerdprasop

Top-k frequent pattern discovery is indeed an association analysis concerning automatic extraction of the k most correlated and interesting patterns from large databases. Current studies in association mining concentrate on how to effectively find all objects that are frequently co-occurring. Given...

Full description

Saved in:
Bibliographic Details
Main Authors: Kerdprasop, Nittaya, Kerdprasop, Kittisak
Format: Article
Language:English
Published: Faculty of Computer and Mathematical Sciences 2014
Online Access:https://ir.uitm.edu.my/id/eprint/12418/1/12418.pdf
https://ir.uitm.edu.my/id/eprint/12418/
https://mjoc.uitm.edu.my/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uitm.ir.12418
record_format eprints
spelling my.uitm.ir.124182022-06-14T02:48:32Z https://ir.uitm.edu.my/id/eprint/12418/ The discovery of Top-K DNA frequent patterns with approximate method / Nittaya Kerdprasop and Kittisak Kerdprasop Kerdprasop, Nittaya Kerdprasop, Kittisak Top-k frequent pattern discovery is indeed an association analysis concerning automatic extraction of the k most correlated and interesting patterns from large databases. Current studies in association mining concentrate on how to effectively find all objects that are frequently co-occurring. Given a set of objects with m features, there are almost 2m frequent patterns to consider. For DNA data that are normally very high in dimensionality, frequent pattern discovery from genetic data is obviously a computationally expensive problem. We therefore devise an approximate approach to tackle this problem. We propose an approximate method based on the window sliding concept to estimate data density and obtain data characteristics from a small set of samples. Then we draw a set of representatives with reservoir sampling technique. These representatives are subsequently used in the main process of frequent pattern mining. Our designed algorithm had been implemented with the Erlang language, which is the functional programming paradigm with inherent support for pattern matching. The experimental results confirm the efficiency and reliability of our approximate method. Faculty of Computer and Mathematical Sciences 2014 Article PeerReviewed text en https://ir.uitm.edu.my/id/eprint/12418/1/12418.pdf The discovery of Top-K DNA frequent patterns with approximate method / Nittaya Kerdprasop and Kittisak Kerdprasop. (2014) Malaysian Journal of Computing (MJoC), 2 (2). pp. 1-12. ISSN 2231-7473 https://mjoc.uitm.edu.my/
institution Universiti Teknologi Mara
building Tun Abdul Razak Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Mara
content_source UiTM Institutional Repository
url_provider http://ir.uitm.edu.my/
language English
description Top-k frequent pattern discovery is indeed an association analysis concerning automatic extraction of the k most correlated and interesting patterns from large databases. Current studies in association mining concentrate on how to effectively find all objects that are frequently co-occurring. Given a set of objects with m features, there are almost 2m frequent patterns to consider. For DNA data that are normally very high in dimensionality, frequent pattern discovery from genetic data is obviously a computationally expensive problem. We therefore devise an approximate approach to tackle this problem. We propose an approximate method based on the window sliding concept to estimate data density and obtain data characteristics from a small set of samples. Then we draw a set of representatives with reservoir sampling technique. These representatives are subsequently used in the main process of frequent pattern mining. Our designed algorithm had been implemented with the Erlang language, which is the functional programming paradigm with inherent support for pattern matching. The experimental results confirm the efficiency and reliability of our approximate method.
format Article
author Kerdprasop, Nittaya
Kerdprasop, Kittisak
spellingShingle Kerdprasop, Nittaya
Kerdprasop, Kittisak
The discovery of Top-K DNA frequent patterns with approximate method / Nittaya Kerdprasop and Kittisak Kerdprasop
author_facet Kerdprasop, Nittaya
Kerdprasop, Kittisak
author_sort Kerdprasop, Nittaya
title The discovery of Top-K DNA frequent patterns with approximate method / Nittaya Kerdprasop and Kittisak Kerdprasop
title_short The discovery of Top-K DNA frequent patterns with approximate method / Nittaya Kerdprasop and Kittisak Kerdprasop
title_full The discovery of Top-K DNA frequent patterns with approximate method / Nittaya Kerdprasop and Kittisak Kerdprasop
title_fullStr The discovery of Top-K DNA frequent patterns with approximate method / Nittaya Kerdprasop and Kittisak Kerdprasop
title_full_unstemmed The discovery of Top-K DNA frequent patterns with approximate method / Nittaya Kerdprasop and Kittisak Kerdprasop
title_sort discovery of top-k dna frequent patterns with approximate method / nittaya kerdprasop and kittisak kerdprasop
publisher Faculty of Computer and Mathematical Sciences
publishDate 2014
url https://ir.uitm.edu.my/id/eprint/12418/1/12418.pdf
https://ir.uitm.edu.my/id/eprint/12418/
https://mjoc.uitm.edu.my/
_version_ 1736837186418900992
score 13.211869

Similar Items