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.
Issue title: Special Section: Intelligent and Fuzzy Systems applied to Language & Knowledge Engineering
Guest editors: David Pinto and Vivek Singh
Article type: Research Article
Authors: Rodríguez-González, Ansel Y.a; b; * | Martínez-Trinidad, José F.c | Carrasco-Ochoa, Jesús A.c | Ruiz-Shulcloper, Joséd | Alvarado-Mentado, Matíase
Affiliations: [a] Mexican National Research Council (CONACyT) | [b] CICESE-UT3, Andador 10 #109, Ciudad del Conocimiento, Tepic, Nayarit, México | [c] Department of Computer Sciences, National Institute of Astrophysics, Optics and Electronics (INAOE), Luis Enrique Erro 1, Tonantzintla, Puebla, 72840, Mexico | [d] University of Informatics Sciences (UCI), Carretera a San Antonio de los Baños, Km. 2 1/2, Havana, Cuba | [e] Department of Computer Science, Center of Research and Advanced Studies (CINVESTAV), Instituto Politécnico Nacional 2508, D.F., 07300, Mexico
Correspondence: [*] Corresponding author. Ansel Y. Rodríguez-González. E-mail: ansel@cicese.mx.
Abstract: There are many problems were the objects under study are described by mixed data (numerical and non numerical features) and similarity functions different from the exact matching are usually employed to compare them. Some algorithms for mining frequent patterns allow the use of Boolean similarity functions different from exact matching. However, they do not allow the use of non Boolean similarity functions. Transforming a non Boolean similarity function into a Boolean one, and then applying the previous algorithms for mining frequent patterns, could lead to loss some patterns, and even more to generate some other patterns which indeed should not be considered as frequent similar patterns. In this paper, we extend the similar frequent pattern mining by allowing the use of non Boolean similarity functions. Several properties for pruning the search space of frequent similar patterns and a data structure that allows computing the frequency of patterns candidates, are proposed. Also, three algorithms for mining frequent patterns using non Boolean similarity functions are proposed. Experimental results show the efficiency and efficacy of the algorithms. The proposed algorithms obtain better patterns for classification than those patterns obtained by traditional frequent pattern miners, and miners using Boolean similarity functions.
Keywords: Data mining, frequent patterns, similarity functions, Mixed data
DOI: 10.3233/JIFS-179040
Journal: Journal of Intelligent & Fuzzy Systems, vol. 36, no. 5, pp. 4931-4944, 2019
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