Research on Algorithm of Function Set Mining Based on Interests

Jing Zun Zhang; Yu Xin Wang; Rui Zhe Zhang

doi:10.4028/www.scientific.net/AMR.532-533.1691

Paper Titles

A New Algorithm of Video Key Frame Extraction Based on the Block of Frame Image
p.1670

Research on Data Mining Based on Apriori Algorithm
p.1675

An Algorithms for Super-Resolution Reconstruction of Video Based on Spatio-Temporal Adaptive
p.1680

An Improved SPRINT Algorithm
p.1685

Research on Algorithm of Function Set Mining Based on Interests
p.1691

Application of Chaotic Encryption Algorithm in RFID Secure Mechanism
p.1695

Study on Moving Object Detection Algorithm in Outdoor Video Surveillance System
p.1700

A New Hybrid Image Reconstruction Algorithm for Magnetic Induction Tomography
p.1706

Evolutionary Algorithm Research Based on Neural Network for Fuzzy Cognitive Map
p.1711

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 532-533Research on Algorithm of Function Set Mining Based...

Research on Algorithm of Function Set Mining Based on Interests

Abstract:

Function mining aims to discover valid functions from various data which seem not related. Nowadays, the results of most mining algorithms are not capable to characterize the things fully, because the algorithms aim at one simple function, meanwhile, another one can achieve this task, but its efficiency is very low because of the too much iteration. The paper presents one new algorithm named interest-based function set mining algorithm (IFSM), it applies the user's experience, expectations and prior knowledge to the mining process. IFSM succeeds in improving the description and enhancing the mining efficiency and quality.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 532-533)

Pages:

1691-1694

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.532-533.1691

Citation:

Cite this paper

Online since:

June 2012

Authors:

Jing Zun Zhang, Yu Xin Wang, Rui Zhe Zhang

Keywords:

Function Mining, Function Set, Interest

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Candida Ferreira. Gene Expression Programming: A new adaptive algorithm for solving problems, Complex Systems, (2001).

Google Scholar

[2] Han Jia-Wei, Kambr Micheline. Data Mining—Concepts andTechniques. Beijing: Higher Education Press, 2001J.

Google Scholar

[3] ASADA T, SWONGER RF, BOUND N, et al. The quantified de-sign space: A tool for the quantitative analysis ofdesign[R]. Tech-nicalReportCMU-CS-92-213, CarnegieMellonUniversity, (1992).

Google Scholar

[4] Han J, Pei J, Yin Y. Mining frequent patt erns without candidate g ener ation [ A ] . P roc 2000 ACM-S IGMOD Int Confon Management of Data ( SIGM OD'00) [ C] . Dallas, 2000. 1-12.

DOI: 10.1145/342009.335372

Google Scholar

[5] R. Srikant, R. Agrawal. Mining Association Rules with Item Constrains. Proc. of the 3rd Int'l Conference on Knowledge Discovery in Databases and Data Mining, California, August 1997: pp.67-73.

Google Scholar