Speeding up Relief algorithms with k-d trees
暂无分享,去创建一个
[1] M. Robnik-Sikonja. CORE - a system that predicts continuous variables , 1997 .
[2] Igor Kononenko,et al. Estimating Attributes: Analysis and Extensions of RELIEF , 1994, ECML.
[3] Larry A. Rendell,et al. A Practical Approach to Feature Selection , 1992, ML.
[4] Padhraic Smyth,et al. From Data Mining to Knowledge Discovery: An Overview , 1996, Advances in Knowledge Discovery and Data Mining.
[5] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .
[6] David W. Aha,et al. A Review and Empirical Evaluation of Feature Weighting Methods for a Class of Lazy Learning Algorithms , 1997, Artificial Intelligence Review.
[7] Andrew W. Moore,et al. Efficient Locally Weighted Polynomial Regression Predictions , 1997, ICML.
[8] Marko Robnik-Sikonja,et al. An adaptation of Relief for attribute estimation in regression , 1997, ICML.
[9] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.
[10] Andrew W. Moore,et al. Multiresolution Instance-Based Learning , 1995, IJCAI.
[11] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[12] Alan J. Broder. Strategies for efficient incremental nearest neighbor search , 1990, Pattern Recognit..
[13] Mark Allen Weiss,et al. Data structures and algorithm analysis , 1991 .
[14] David L. Waltz,et al. Toward memory-based reasoning , 1986, CACM.