Abstract
Regression is the study of functional dependency of one numeric variable with respect to another. In this paper, we present a novel, efficient, binary search based regression algorithm having the advantage of low computational complexity. These desirable features make BINER a very attractive alternative to existing approaches. The algorithm is interesting because instead of directly predicting the value of response variable, it recursively narrows down the range in which the response variable lies. Our empirical experiments with several real world datasets show that our algorithm, outperforms current state of art approaches and is faster by an order of magnitude.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Wang, Y., Witten, I.H.: Modeling for optimal probability prediction. In: ICML (2002)
Brieman, L., Friedman, J., Olshen, R., Stone, C.: Classfication and Regression Trees. Wadsworth Inc. (1984)
Chu, W., Keerthi, S.S.: New approaches to support vector ordinal regression. In: ICML (2005)
Haykin, S.: Neural Networks-A comprehensive foundation. Prentice-Hall (1999)
Cover, T.M., Hart, P.E.: Nearest Neighbor Pattern Classfication. IEEE Transactions on Information Theory (1967)
Schapire, R.E.: A Brief Introduction to Boosting. In: ICJAI (1999)
Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Technique. Morgan Kaufmann (2005)
Hyafil, L., Rivest, R.: Constructing Optimal Binary Search Trees is NP Complete. Information Processing Letters (1976)
Hilbe, Joseph, M.: Logistic Regression Models. Chapman and Hall/CRC Press (2009)
Ritzema, H.P.: Frequency and Regression Analysis. In: Drainage Principles and Applications, ch.6, ILRI (1994)
Stone, C.: Consistent nonparametric regression. Annals of Statistics (1977)
Berchtold, S., Ertl, B., Keim, D.A., Kriegel, H.P., Seidl, T.: Fast Nearest Neighbor Search in High Dimensional Space. In: ICDE (1998)
Roussopoulus, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: SIGMOD (1995)
Jahromi, M.Z., Parvinnia, E., John, R.: A method of learning weighted similarity function to improve the performance of nearest neighbor. Information Sciences 179(17) (2009)
Yang, T., Cao, L., Zhang, C.: A Novel Prototype Reduction Method for the K-Nearest Neighbor Algorithm with K ≥ 1. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010. LNCS, vol. 6119, pp. 89–100. Springer, Heidelberg (2010)
Hall, M., Ian, H.: The Weka Data Mining Software: An update. SIGKDD Explorations (2009)
UCI Data Repository, http://archive.ics.uci.edu/ml/datasets.html
Weka Dataset Repository, http://www.cs.waikato.ac.nz/ml/weka/index_datasets.html
ML Dataset Repository, http://mldata.org/repository/data/
Todeschini, R.: Weighted k-Nearest Neighbor Method for the Calculation of Missing Values. Chemometrics and Intelligent Laboratory Systems (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bharambe, S., Dubey, H., Pudi, V. (2012). BINER. In: Perner, P. (eds) Machine Learning and Data Mining in Pattern Recognition. MLDM 2012. Lecture Notes in Computer Science(), vol 7376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31537-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-31537-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31536-7
Online ISBN: 978-3-642-31537-4
eBook Packages: Computer ScienceComputer Science (R0)