This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Traditional approaches for mining generalized association rules are based only on database contents, and focus on exact matches among items. However, in many applications, the use ...
Rafael Garcia Miani, Cristiane A. Yaguinuma, Maril...
Abstract. As mobile devices proliferate and networks become more locationaware, the corresponding growth in spatio-temporal data will demand analysis techniques to mine patterns th...
This paper introduces a new approach to a problem of data sharing among multiple parties, without disclosing the data between the parties. Our focus is data sharing among parties i...
Justin Z. Zhan, Stan Matwin, Nathalie Japkowicz, L...
Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an effic...
Ashok Savasere, Edward Omiecinski, Shamkant B. Nav...