%0 Journal Article %1 IJACSA.2010.010509 %A Sabita Barik Debahuti Mishra, Shruti Mishra Sandeep Ku. Satapathy Amiya Ku. Rath Milu Acharya %D 2010 %J International Journal of Advanced Computer Science and Applications(IJACSA) %K Algorithm Algorithm, Apriori Association Data; Expression FP-growth Frequent Mining,Gene Pattern Rule mining; %N 5 %T Pattern Discovery using Fuzzy FP-growth Algorithm from Gene Expression Data %U http://ijacsa.thesai.org/ %V 1 %X The goal of microarray experiments is to identify genes that are differentially transcribed with respect to different biological conditions of cell cultures and samples. Hence, method of data analysis needs to be carefully evaluated such as clustering, classification, prediction etc. In this paper, we have proposed an efficient frequent pattern based clustering to find the gene which forms frequent patterns showing similar phenotypes leading to specific symptoms for specific disease. In past, most of the approaches for finding frequent patterns were based on Apriori algorithm, which generates and tests candidate itemsets (gene sets) level by level. This processing causes iterative database (dataset) scans and high computational costs. Apriori algorithm also suffers from mapping the support and confidence framework to a crisp boundary. Our hybridized Fuzzy FP-growth approach not only outperforms the Apriori with respect to computational costs, but also it builds a tight tree structure to keep the membership values of fuzzy region to overcome the sharp boundary problem and it also takes care of scalability issues as the number of genes and condition increases.

@article{IJACSA.2010.010509, abstract = {The goal of microarray experiments is to identify genes that are differentially transcribed with respect to different biological conditions of cell cultures and samples. Hence, method of data analysis needs to be carefully evaluated such as clustering, classification, prediction etc. In this paper, we have proposed an efficient frequent pattern based clustering to find the gene which forms frequent patterns showing similar phenotypes leading to specific symptoms for specific disease. In past, most of the approaches for finding frequent patterns were based on Apriori algorithm, which generates and tests candidate itemsets (gene sets) level by level. This processing causes iterative database (dataset) scans and high computational costs. Apriori algorithm also suffers from mapping the support and confidence framework to a crisp boundary. Our hybridized Fuzzy FP-growth approach not only outperforms the Apriori with respect to computational costs, but also it builds a tight tree structure to keep the membership values of fuzzy region to overcome the sharp boundary problem and it also takes care of scalability issues as the number of genes and condition increases.}, added-at = {2014-02-21T08:00:08.000+0100}, author = {{Sabita Barik Debahuti Mishra}, Shruti Mishra Sandeep Ku. Satapathy Amiya Ku. Rath Milu Acharya}, biburl = {https://www.bibsonomy.org/bibtex/2cc19f22785038786a7e4d89236d0fdf6/thesaiorg}, interhash = {67203b44fee4425953c80b6e84032679}, intrahash = {cc19f22785038786a7e4d89236d0fdf6}, journal = {International Journal of Advanced Computer Science and Applications(IJACSA)}, keywords = {Algorithm Algorithm, Apriori Association Data; Expression FP-growth Frequent Mining,Gene Pattern Rule mining;}, number = 5, timestamp = {2014-02-21T08:00:08.000+0100}, title = {{Pattern Discovery using Fuzzy FP-growth Algorithm from Gene Expression Data}}, url = {http://ijacsa.thesai.org/}, volume = 1, year = 2010 }