|
ABSTRACT
This paper presents CSar, a Michigan-style Learning Classifier System which has been designed for extracting quantitative association rules from streams of unlabeled examples. The main novelty of CSar with respect to the existing association rule miners isthat it evolves the knowledge on-line and so it is prepared to adapt its knowledge to changes in the variable associations hidden in the stream of unlabeled data quickly and efficiently. Preliminary results provided in this paper show that CSar is able to evolve interesting rules on problems that consist of both categorical and continuous attributes. Moreover, the comparison of CSar with Apriori on a problem that consists only of categorical attributes highlights the competitiveness of CSar with respect to more specific learners that perform enumeration to return all possible association rules. These promising results encourage us for further investigating on CSar.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
Rakesh Agrawal , Tomasz Imieliński , Arun Swami, Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SIGMOD international conference on Management of data, p.207-216, May 25-28, 1993, Washington, D.C., United States
|
| |
3
|
|
| |
4
|
A. Asuncion and D. J. Newman. UCI Machine Learning Repository: {http://www.ics.uci.edu/~mlearn/MLRepository.html}. University of California, 2007.
|
| |
5
|
|
| |
6
|
|
 |
7
|
Takeshi Fukuda , Yasuhido Morimoto , Shinichi Morishita , Takeshi Tokuyama, Mining optimized association rules for numeric attributes, Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.182-191, June 04-06, 1996, Montreal, Quebec, Canada
[doi> 10.1145/237661.237708]
|
| |
8
|
|
| |
9
|
|
| |
10
|
T. P. Hong, C. S. Kuo., and S. C. Chi. Trade-off between computation time and number of rules for fuzzy mining from quantitative data. International Journal of Uncertainty, Fuzziness, and Knowledge-Based Systems, 9(5):587--604, 2001.
|
| |
11
|
M. Houtsma and A. Swami. Set-oriented mining of association rules. Technical Report RJ 9567, Almaden Research Center, San Jose, California, October 1993.
|
| |
12
|
M. Kaya and R. Alhajj. Genetic algorithm based framework for mining fuzzy association rules. Fuzzy Sets and Systems, 152(3):587--601, 2005.
|
| |
13
|
|
 |
14
|
|
 |
15
|
|
| |
16
|
|
| |
17
|
A. Orriols-Puig, J. Casillas, and E. Bernadó-Mansilla. Fuzzy-UCS: a michigan-style learning fuzzy-classifier system for supervised learning. IEEE Transactions on Evolutionary Computation, in press.
|
| |
18
|
A. Salleb-Aouissi, C. Vrain, and C. Nortet. Quantminer: A genetic algorithm for mining quantitative association rules. In M. M. Veloso, editor, Proceedings of the 2007 International Join Conference on Artificial Intelligence, pages 1035--1040, 2007.
|
| |
19
|
|
 |
20
|
|
| |
21
|
C.-Y. Wang, S.-S. Tseng, T.-P. Hong, and Y.-S. Chu. Online generation of association rules under multidimensional consideration based on negative border. Journal of Information Science and Engineering, 23:233--242, 2007.
|
| |
22
|
K. Wang, S. H. W. Tay, and B. Liu. Interestingness-based interval merger for numeric association rules. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, KDD, pages 121--128. AAAI Press, 1998.
|
| |
23
|
|
| |
24
|
S. W. Wilson. Generalization in the XCS classifier system. In 3rd Annual Conf. on Genetic Programming, pages 665--674. Morgan Kaufmann, 1998.
|
| |
25
|
|
|