Baez-Monroy, V. and O'Keefe, S. (2006) The identification and extraction of itemset support defined by the weight matrix of a Self-Organising Map. In: International Joint Conference on Neural Networks, 2006. IJCNN '06. IJCNN 2006, July 16-21, 2006, Vancouver, BC, Canada. , pp. 6550-6557. ISBN 0-7803-9490-9Full text not available from this repository.
Frequent Itemset Mining, which is the core of Association Rule Mining, is a very well-known problem in the data mining field. Similarly, a Self-Organising Map is a well known neural network which has been used for data clustering mainly. In the discovery of frequent itemsets, conforming the raw material to create association rules, the support, being an itemset metric, is highly important since it determines the interestingness of any itemset in a mining process. In this work, we propose and define a probabilistic method to identify and extract from the weight matrix of a trained map the support of all of the possible itemsets that can be formed by the components of the patterns in the training dataset.
|Item Type:||Proceedings Paper|
|Institution:||The University of York|
|Academic Units:||The University of York > Computer Science (York)|
|Depositing User:||York RAE Import|
|Date Deposited:||08 Apr 2009 15:16|
|Last Modified:||08 Apr 2009 15:16|