Region Analogy-Based Quantization Method for Numerical Data

Article Preview

Abstract:

Data quantization methods for numerical attributes play an extremely important role in handy talents statistics assessment and technology learning because discrete values of attributes are required in most classification methods. In this paper, we present an region analogy-based quantization method for numerical data. It expresses an inner coherence criterion which is thought to be as a new criterion in the ways of quantization. In addition, a heuristic quantization algorithm is proposed to achieve a satisfying quantization result with the aim to improve the performance of inductive learning algorithms. They realize criterion as well as quantifying the true value attributions exactly and reasonably. Strict experiments on UCI reflects data sets express that our supposed algorithm produces a superior quantization scheme that promotes the classification right of inductive learning than emerging quantization algorithms.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 989-994)

Pages:

1743-1746

Citation:

Online since:

July 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] K. J. Cios, and L. A. Kurgan, CLIP4: hybrid inductive machine learning algorithm that generates inequality rules, Information Sciences, vol. 177, no. 17, p.3592–3612, (2007).

DOI: 10.1016/j.ins.2003.03.015

Google Scholar

[2] J. R. Quinlan, C4. 5: programs for machine learning, San Mateo, Calif.: Morgan Kauf-mann, (1993).

Google Scholar

[3] H. Liu, F. Hussain, C. L. Tan, and M. Dash, Discretization: an enabling technique, Journal of Data Mining and Knowledge Discovery, vol. 6, no. 4, p.393–423, (2012).

Google Scholar

[4] J. Dougherty, R. Kohavi, and M. Sahami, Supervised and unsupervised discretization of continuous feature, Machine learning: Proc. 12th Intl Conf., p.194–202, (1995).

DOI: 10.1016/b978-1-55860-377-6.50032-3

Google Scholar

[5] E. H. Tay and L. Shen, A modified chi2 algorithm for discretization, IEEE Transactions on Knowledge and Data Engineering, vol. 14, no. 3, p.666–670, (2002).

DOI: 10.1109/tkde.2002.1000349

Google Scholar

[6] C. T. Su and J. H. Hsu, An extended chi2 algorithm for discretization of real value attributes, IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 3, p.437–441, (2005).

DOI: 10.1109/tkde.2005.39

Google Scholar

[7] C. J. Tsai, C. I. Lee, and W. P. Yang, A discretization algorithm based on class-attribute contingency coefficient, Information Sciences, vol. 178, no. 19, p.714–731, (2008).

DOI: 10.1016/j.ins.2007.09.004

Google Scholar

[8] L. L. Liu, A. K. C. Wong, and Y. Wang, A global optimal algorithm for class-dependent discretization of continuous data, Intelligent Data Analysis, vol. 8, no. 2, p.151–170, (2004).

DOI: 10.3233/ida-2004-8204

Google Scholar