List of Journals    /    Call For Papers    /    Subscriptions    /    Login
 
 
 
 
 SEARCH
By Author By Title
 
 
ABOUT CSC
 About CSC Journals
 CSC Journals Objectives
 List of Journals
 CALL FOR PAPERS
 Call For Papers CFP
 Special Issue CFP
AUTHOR GUIDELINES
 Submission Guidelines
 Peer Review Process
 Helpful Hints For Getting Published
 Plagiarism Policies
 Abstracting & Indexing
 Open Access Policy
 Submit Manuscript
 FOR REVIEWERS
 Reviewer Guidelines
 FOR EDITORIAL
 Editor Guidelines
 Join Us As Editor
 Launch Special Issue
 Suggest New Journal
 CSC LIBRARY
 Browse CSC Library
 Open Access Policy
  SERVICES
 Conference Partnership Program (CPP)
 Abstracting & Indexing
 SUBSCRIPTIONS
 Subscriptions
 Discounted Packages
 Archival Subscriptions
 How to Subscribe
 Librarians
 Subscriptions Agents
 Order Form
 DOWNLOADS
 
 
 
 
Mining Spatial Gene Expression Data Using Association Rules
Full text
 PDF(262.5KB)
Source 
International Journal of Computer Science and Security (IJCSS)
Table of Contents
Download Complete Issue    PDF(3.22MB)
Volume:  3    Issue:  5
Pages:  334-447
Publication Date:   November 2009
ISSN (Online): 1985-1553
Pages 
351 - 357
Author(s)  
M.Anandhavalli - India
M.K.Ghose - India
K.Gauthaman - India
 
Published Date   
26-12-2009 
Publisher 
CSC Journals, Kuala Lumpur, Malaysia
ADDITIONAL INFORMATION
Keywords   Abstract   References   Cited by   Related Articles   Collaborative Colleague
 
KEYWORDS:   Association Rule, Spatial Gene expression data, Similarity Matrix, Boolean vector 
 
 
This Manuscript is indexed in the following databases/websites:-
1. Directory of Open Access Journals (DOAJ)
2. Free-Books-Online
3. ScientificCommons
4. PDFCAST
5. Docstoc
6. Scribd
7. Google Scholar
8. CiteSeerX
9. WorldCat
10. ResearchGATE
11. Academic Index
12. Bielefeld Academic Search Engine (BASE)
13. iSEEK
14. Libsearch
15. slideshare
 
 
One of the important problems in data mining is discovering association rules from spatial gene expression data where each transaction consists of a set of genes and probe patterns. The most time consuming operation in this association rule discovery process is the computation of the frequency of the occurrences of interesting subset of genes (called candidates) in the database of spatial gene expression data. A fast algorithm has been proposed for generating frequent itemsets without generating candidate itemsets along with strong association rules. The proposed algorithm uses Boolean vector with relational AND operation to discover frequent itemsets. Experimental results shows that combining Boolean Vector and relational AND operation results in quickly discovering of frequent itemsets and association rules as compared to general Apriori algorithm .  
 
 
 
1 Baldock,R.A., Bard,J.B., Burger,A., Burton,N., Christiansen,J., Feng,G., Hill,B., Houghton,D., Kaufman,M., Rao,J. et al., “EMAP and EMAGE: a framework for understanding spatially organized data”, Neuroinformatics, 1, 309–325, 2003.
2 Pang-Ning Tan, Micahel Steinbach, Vipin Kumare, ”Intoduction to Data Mining Pearson Education”, second edition, pp.74, 2008.
3 Agrawal, R. & Srikant, R., “Fast Algorithms for Mining Association Rules in large databases”. In Proceedings of the 20th International Conference on Very Large Databases pp. 487-499. Santiago, Chile, 1994.
4 Agrawal, R., Imielinski, T., & Swami, A., ”Mining association rules between sets of items in large databases”. Proceedings of the ACM SICMOD conference on management of data”, Washington, D.C, 1993.
5 Xu, Z. & Zhang, S., “An Optimization Algorithm Base on Apriori for Association Rules”. Computer Engineering 29(19), 83-84, 2003.
6 J S. Park and M -S. Chen and PS. Yu, “An effective hash-based algorithm for mining association rules”, Proceedings of the ACM SIGMOD International Conference on Management of Data", San Jose, CA, May 1995.
7 A Savasere, E. Ommcinskl and S Navathe, “An efficient algorithm for mining association rules in large databases”, In Proceedings Of the 21st International Conference on Very Large Databases, Zurich, Switzerland, September 1995.
 
 
 
1 M. Anandhavalli, M. K. Ghose, K. Gauthaman and M. Boosha, “Global Search Analysis of Spatial Gene Expression Data Using Genetic Algorithm”, Computer Science Recent Trends in Network Security and Applications Communications in Computer and Information Science, 89(3), pp. 593-602, 2010.
2 O. J. Oyelade and O. O. Oyejoke , “Knowledge Discovery from Students’ Result Repository: Association Rule Mining Approach”, International Journal of Computer Science and Security (IJCSS), 4(2), pp. 199 – 207, 2010.
3 S. M. Elayidom , S. M. Idikkula and J. Alexander, “Applying statistical dependency analysis techniques In a Data mining Domain”, International Journal of Data Engineering (IJDE), 1(2), pp. 14 – 24, 2010.
4 E. Chandra and K. Nandhini, “Knowledge Mining from Student Data”, European Journal of Scientific Research, 47(1), pp.156-163, 2010.
 
 
 
1 Academia.edu
 
2 4shared
 
 
 
M.Anandhavalli : Colleagues
M.K.Ghose : Colleagues
K.Gauthaman : Colleagues  
 
 
 
  Untitled Document
 
Copyrights (c) 2012 Computer Science Journals. All rights reserved.
Best viewed at 1152 x 864 resolution. Microsoft Internet Explorer.
 
  
 
Copyrights & Usage: Articles published by CSC Journals are Open Access. Permission to copy and distribute any other content, images, animation and other parts of this website is prohibited. CSC Journals has the rights to take action against individual/group if they are found victim of copying these parts of the website.