Using non boolean similarity functions for frequent similar pattern mining

Authors:
Ansel Y. Rodríguez-González;José Fco. Martínez-Trinidad;Jesús Ariel Carrasco-Ochoa;José Ruiz-Shulcloper
Affiliations:
,Advanced Technologies Applications Center, Havana, Cuba;National Institute of Astrophysics, Optics and Electronics, Puebla, México;National Institute of Astrophysics, Optics and Electronics, Puebla, México;Advanced Technologies Applications Center, Havana, Cuba
Venue:
AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
Year:
2010

Citing 4
Cited 0

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Frequent pattern mining: current status and future directions

Data Mining and Knowledge Discovery
Mining Frequent Similar Patterns on Mixed Data

CIARP '08 Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications
Structuralization of universes

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we focus on frequent pattern mining using non Boolean similarity functions Several properties and propositions that allow pruning the search space of frequent similar patterns, are proposed Based on these properties, an algorithm for mining frequent similar patterns using non Boolean similarity functions is also introduced We evaluate the quality of the frequent similar patterns computed by our algorithm by means of a supervised classifier based on frequent patterns.