Finding Essential Attributes in Binary Data-Reference-Cited by-同舟云学术

Finding Essential Attributes in Binary Data

Published:2000 Issue: Volume: Page:133-138
ISSN:0302-9743
Container-title:Intelligent Data Engineering and Automated Learning — IDEAL 2000. Data Mining, Financial Engineering, and Intelligent Agents
language:
Short-container-title:

Author:

Boros Endre,Horiyama Takashi,Ibaraki Toshihide,Makino Kazuhisa,Yagiura Mutsunori

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44491-2_20

Reference25 articles.

1. H. Almuallim and T. Dietterich. Learning Boolean concepts in the presence of many irrelevant features. Artificial Intelligence 69 (1994) 279–305.

2. R. Agrawal, T. Imielinski and A. Swami. Mining association rules between sets of items in large databases. In: International Conference on Management of Data (SIGMOD 93), (1993) pp. 207–216.

3. D. Angluin. Queries and concept learning. Machine Learning 2 (1988) 319–342.

4. A. Blum, L. Hellerstein, and N. Littlestone. Learning in the presence of finitely or infintely many irrelevant attributes. Journal of Computer and System Sciences 50 (1995) pp. 32–40.

5. A. Blum and P. Langley. Selection of relevant features and examples in machine learning. Artificial Intelligence 67 (1997) 245–285.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Supervised box clustering;Advances in Data Analysis and Classification;2016-02-02

2. Measuring the impact of data mining on churn management;Internet Research;2001-12-01

3. Finding Essential Attributes in Binary Data;Intelligent Data Engineering and Automated Learning — IDEAL 2000. Data Mining, Financial Engineering, and Intelligent Agents;2000