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

QR Code

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

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/

Similar Items

Empirical discourse analysis on correlations between exchange rate and exports / Chayongkan Parnornmast, Kittisak Jermsittiparsert and Thanaporn Sriyakul
by: Parnornmast, Chayongkan, et al.
Published: (2013)

A numerical method for frequent pattern mining
by: Mustapha, Norwati, et al.
Published: (2009)

An empirical proposal on power, knowledge and truth of correlations among the minimum wage, foreign direct investment in the industrial sector and export / Kittisak Jermsittiparsert, Thanaporn Sriyakul and Chayongkan Pamornmast
by: Kittisak, Jermsittiparsert, et al.
Published: (2012)

Prime-based method for interactive mining of frequent patterns
by: Nadimi-Shahraki, Mohammad-Hossein
Published: (2010)

Efficient prime-based method for interactive mining of frequent patterns.
by: Mohammad Hossein, Nadimi Shahraki, et al.
Published: (2011)

Informative top-k class associative rule for cancer biomarker discovery on microarray data
by: Ong, Huey Fang, et al.
Published: (2020)

Informative top-k class associative rule for cancer biomarker discovery on microarray data
by: Ong, Huey Fang, et al.
Published: (2020)

A Scalable Algorithm for Constructing Frequent Pattern Tree
by: Noraziah, Ahmad, et al.
Published: (2014)

Compact structure representation in discovering frequent patterns for association rules
by: Mustapha, Norwati, et al.
Published: (2002)

DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database
by: Zailani, Abdullah, et al.
Published: (2012)

Frequent patterns minning of stock data using hybrid clustering association algorithm
by: B., Baharudin, et al.
Published: (2009)

EFP-M2: Efficient model for mining frequent patterns in transactional database
by: Herawan, Tutut, et al.
Published: (2012)

A new method for mining maximal frequent itemsets
by: Nadimi-Shahraki, Mohammad-Hossein, et al.
Published: (2008)

Efficiently mining frequent patterns from dense datasets using a cluster of computers
by: Rudra, Amit, et al.
Published: (2003)

Using unique-prime-factorization theorem to mine frequent patterns without generating tree
by: Tohidi, Hossein, et al.
Published: (2011)

A frequent pattern mining algorithm based on FP-growth without generating tree
by: Tohidi, Hossein, et al.
Published: (2010)

Visual mining of moving flock patterns in large spatio-temporal data sets using a frequent pattern approach
by: Turdukulov, Ulanbek, et al.
Published: (2014)

Classification and pattern discovery of mood in weblogs
by: Nguyen, Thin, et al.
Published: (2010)

Advanced Trace Pattern For Computer Intrusion Discovery
by: Selamat, S. R., et al.
Published: (2010)

Fast discovery of long patterns for association rules
by: Mustapha, N., et al.
Published: (2003)

Visualizing the construction of incremental Disorder Trie Itemset data structure (DOSTrieIT) for Frequent Pattern Tree (FP-Tree)
by: Zailani, Abdullah, et al.
Published: (2011)

The behavioral effects of frequent nightmares on stress tolerance
by: Hochard, Kevin D., et al.
Published: (2016)

Frequent Lexicographic Algorithm for Mining Association Rules
by: Mustapha, Norwati
Published: (2005)

Spinning the cultural tale: multiculturalism in K. S. Maniam's top winner
by: Mohd. Azrul, Mohd. Ezamir Azral, et al.
Published: (2015)

Solitary wave solutions with compact support for the nonlinear dispersive K (m,n) equations by using approximate analytical method
by: Che Hussin, Che Haziqah, et al.
Published: (2021)

HYBRID: an efficient unifying process to mine frequent itemsets
by: Zulkurnain, Nurul Fariza, et al.
Published: (2018)

SEQUEST: Mining frequent subsequences using DMA strips
by: Tan, H., et al.
Published: (2006)

Mining frequent sequences using itemset-based extension
by: Ma, Zhixin, et al.
Published: (2008)

Frequent attenders in general practice: an attempt to reduce attendance
by: Jiwa, Moyez
Published: (2000)

Evaluation and optimization of frequent association rule based classification
by: Izwan Nizal Mohd Shaharanee,, et al.
Published: (2014)

DNA implementation of k-shortest paths computation
by: Ibrahim, Zuwairie, et al.
Published: (2005)

Linear-PSO with binary search algorithm for DNA Motif Discovery / Hazaruddin Harun
by: Harun, Hazaruddin
Published: (2015)

Linear-pso with binary search algorithm for DNA motif discovery / Hazaruddin Harun
by: Harun, Hazaruddin
Published: (2015)

Efficient top-k continuous query processing over sliding window model (SWM) method on uncertain data stream
by: Wahab, Raja Azhan Syah Raja, et al.
Published: (2024)

Frequent itemset mining in high dimensional data: a review
by: Md. Zaki, Fatimah Audah, et al.
Published: (2019)

What would make children read for pleasure more frequently?
by: Merga, Margaret
Published: (2017)

A study Of channel assignment approach to reduce frequent reassignment
by: Omar, Zakaria, et al.
Published: (2011)

Cognitive processing differences between frequent and infrequent Internet users.
by: Johnson, Genevieve
Published: (2008)

Implications of frequent subtree mining using hybrid support definitions
by: Hadzic, Fedja, et al.
Published: (2007)

Villin expression is frequently lost in poorly differentiated colon cancer
by: Arango, D., et al.
Published: (2012)