Language:   Search:   Contact
World of
Mathematics
Database
»ZBMATH«
MSC 2000
MSC 2010
Reviewer
Service
Subscription
»ZBMATH«
ZBMATH Database | Advanced Search Print
Read more | Try MathML | Hide
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

ZBMATH Database Simple Search Advanced Search Command Search

Advanced Search

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 1053.68616
Kanda, Kouta; Haraguchi, Makoto; Okubo, Yoshiaki
Constructing approximate informative basis of association rules.
(English)
[A] Jantke, Klaus P. (ed.) et al., Discovery science. 4th international conference, DS 2001, Washington, DC, USA, November 25--28, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2226, 141-154 (2001). ISBN 3-540-42956-5

Summary: In the study of discovering association rules, it is regarded as an important task to reduce the number of generated rules without loss of any information about the significant rules. From this point of view, Bastide, et al. (2000) have proposed to generate only non-redundant rules. Although the number of generated rules can be reduced drastically by taking the redundancy into account, many rules are often still generated. In this paper, we try to propose a method for reducing the number of the generated rules by extending the original framework. For this purpose, we introduce a notion of approximate generator and consider an approximate redundancy. According to our new notion of redundancy, many non-redundant rules in the original sense are judged redundant and invisible to users. This achieves the reduction of generated rules. Furthermore, it is shown that any redundant rule can be easily reconstructed from our non-redundant rule with its approximate support and confidence. The maximum errors of these values can be evaluated by a user-defined parameter. We present an algorithm for constructing a set of non-redundant rules, called an approximate informative basis. The completeness and weak-soundness of the basis are theoretically shown. Any significant rule can be reconstructed from the basis and any rule reconstructed from the basis is (approximately) significant. Some experimental results show an effectiveness of our method as well.
MSC 2000:
*68T05 Learning and adaptive systems
Login Username: Password:

Highlights
Scientific prize winners of the ICM 2010
Overhang
Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Master Server

Zentralblatt MATH Berlin [Germany]

© FIZ Karlsruhe GmbH

Zentralblatt MATH master server is maintained by the Editorial Office in Berlin, Section Mathematics and Computer Science of FIZ Karlsruhe and is updated daily.

Other Mirror Sites



Copyright © 2013 Zentralblatt MATH | European Mathematical Society | FIZ Karlsruhe | Heidelberg Academy of Sciences
Published by Springer-Verlag | Webmaster