Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Anuradha, R.a; * | Rajkumar, N.b
Affiliations: [a] Department of Computer Science and Engineering, Sri Ramakrishna Engineering College, Coimbatore, Tamilnadu, India | [b] Nehru Institute of Technology, Coimbatore, Tamilnadu, India
Correspondence: [*] Corresponding author. R. Anuradha, Assistant Professor, Department of Computer Science and Engineering, Sri Ramakrishna Engineering College, Coimbatore 640122, Tamilnadu, India. Tel.: +91 422 2460088; Fax: +91 422 2461089; E-mail: anuradha.r@srec.ac.in.
Abstract: Machine-learning and data-mining techniques have been developed to turn data into useful task-oriented knowledge. The algorithms for mining association rules identify relationships among transactions using binary values and find rules at a single-concept level or multiple levels. Mining associations among itemsets only by using support and confidence thresholds at different levels of hierarchical data would not give interesting rules both for binary or quantitative data. This paper proposes a two phase algorithm that mines rare generalized fuzzy coherent rules at inter-cross level hierarchies. During phase-I both positive and negative fuzzy coherent rules are mined and in Phase-II, rare generalized fuzzy coherent rules are extracted from the resultant rules obtained from Phase-I. The algorithm framework works on top down methodology in generating positive and negative fuzzy coherent rules and mining rare generalized rules from it. Experiments conducted using synthetic dataset show the performance of the proposed algorithm in terms of the number of rare generalized rules generated, compared to fuzzy multiple-level association rule mining algorithm.
Keywords: Fuzzy association rule, fuzzy coherent rule, rare generalized coherent rule, membership function, taxonomies
DOI: 10.3233/JIFS-16240
Journal: Journal of Intelligent & Fuzzy Systems, vol. 32, no. 3, pp. 2269-2280, 2017
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl