The discovery of Top-K DNA frequent patterns with approximate method

Kerdprasop, Nittaya and Kerdprasop, Kittisak (2014) The discovery of Top-K DNA frequent patterns with approximate method. Malaysian Journal of Computing (MJoC), 2 (2). pp. 1-12. ISSN 2231-7473

Download

[thumbnail of 12418.pdf] Text
12418.pdf

Download (541kB)

Abstract

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.

Metadata

Item Type: Article
Creators:
Creators
Email
Kerdprasop, Nittaya
nittaya@sut.ac.th
Kerdprasop, Kittisak
kittisakThailand@gmail.com
Divisions: Universiti Teknologi MARA, Shah Alam > Faculty of Computer and Mathematical Sciences
Journal or Publication Title: Malaysian Journal of Computing (MJoC)
UiTM Journal Collections: UiTM Journal > Malaysian Journal of Computing (MJoC)
ISSN: 2231-7473
Volume: 2
Number: 2
Page Range: pp. 1-12
Official URL: https://mjoc.uitm.edu.my/
Item ID: 12418
Uncontrolled Keywords: Top-k frequent patterns, Approximate method, DNA patterns, Window sliding, Reservoir sampling, Erlang language
URI: https://ir.uitm.edu.my/id/eprint/12418

ID Number

12418

Indexing


View in Google Scholar

Edit Item
Edit Item