Statistical methods with applications to machine learning and artificial intelligence
暂无分享,去创建一个
Xiaoming Huo | Yibiao Lu | X. Huo | Yibiao Lu
[1] Yoram Singer,et al. An Efficient Boosting Algorithm for Combining Preferences by , 2013 .
[2] Cynthia Rudin,et al. Margin-based Ranking and an Equivalence between AdaBoost and RankBoost , 2009, J. Mach. Learn. Res..
[3] Jean Duchon,et al. Splines minimizing rotation-invariant semi-norms in Sobolev spaces , 1976, Constructive Theory of Functions of Several Variables.
[4] J. Friedman. Greedy function approximation: A gradient boosting machine. , 2001 .
[5] David Furcy,et al. Incremental Heuristic Search in Artificial Intelligence , 2004 .
[6] Rodney C. Wolff,et al. Outlier Treatment and Robust Approaches for Modeling Electricity Spot Prices , 2007 .
[7] Dennis D Cox,et al. Convergence Rates for Multivariate Smoothing Spline Functions. , 1982 .
[8] D. Sansom,et al. Neural networks for forecasting electricity pool price in a deregulated electricity supply industry , 1999 .
[9] Nathan R. Sturtevant,et al. A Comparison of High-Level Approaches for Speeding Up Pathfinding , 2010, AIIDE.
[10] Nathan R. Sturtevant,et al. Portal-Based True-Distance Heuristics for Path Finding , 2010, SOCS.
[11] Faouzi Kossentini,et al. The emerging JBIG2 standard , 1998, IEEE Trans. Circuits Syst. Video Technol..
[12] Xiaoming Huo,et al. Beamlet pyramids: a new form of multiresolution analysis suited for extracting lines, curves, and objects from very noisy image data , 2000, SPIE Optics + Photonics.
[13] Barry Brumitt,et al. Framed-quadtree path planning for mobile robots operating in sparse environments , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).
[14] J. Friedman. Stochastic gradient boosting , 2002 .
[15] D. Donoho. APPLICATIONS OF BEAMLETS TO DETECTION AND EXTRACTION OF LINES , CURVES AND OBJECTS IN VERY NOISY IMAGES , 2001 .
[16] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[17] Nathan R. Sturtevant,et al. Abstraction-Based Heuristics with True Distance Computations , 2009, SARA.
[18] Steven M. LaValle,et al. Planning algorithms , 2006 .
[19] Mikhail Belkin,et al. Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.
[20] Xiaoming Huo,et al. JBEAM: multiscale curve coding via beamlets , 2005, IEEE Transactions on Image Processing.
[21] J. Contreras,et al. ARIMA Models to Predict Next-Day Electricity Prices , 2002, IEEE Power Engineering Review.
[22] Xiaoming Huo,et al. Sparse image representation via combined transforms , 1999 .
[23] Nathan R. Sturtevant,et al. Partial Pathfinding Using Map Abstraction and Refinement , 2005, AAAI.
[24] X. Huo,et al. Electricity Price Curve Modeling and Forecasting by Manifold Learning , 2008, IEEE Transactions on Power Systems.
[25] Xiaoming Huo,et al. Near-optimal detection of geometric objects by fast multiscale methods , 2005, IEEE Transactions on Information Theory.
[26] Xiaoming Huo,et al. Beamlab and Reproducible Research , 2004, Int. J. Wavelets Multiresolution Inf. Process..
[27] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[28] Panagiotis Tsiotras,et al. Incremental Multi-Scale Search Algorithm for Dynamic Path Planning With Low Worst-Case Complexity , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[29] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[30] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[31] Hsuan-Tien Lin,et al. A note on Platt’s probabilistic outputs for support vector machines , 2007, Machine Learning.
[32] Michael Buro,et al. HPA* Enhancements , 2007, AIIDE.
[33] Junhua Zhao,et al. A Framework for Electricity Price Spike Analysis With Advanced Data Mining Methods , 2007, IEEE Transactions on Power Systems.
[34] P. Tsiotras,et al. Multiresolution path planning with wavelets: A local replanning approach , 2008, 2008 American Control Conference.
[35] Mikhail Belkin,et al. Semi-supervised Learning by Higher Order Regularization , 2011, AISTATS.
[36] Nathan R. Sturtevant,et al. Graph Abstraction in Real-time Heuristic Search , 2007, J. Artif. Intell. Res..
[37] Larry S. Davis,et al. Multiresolution path planning for mobile robots , 1986, IEEE J. Robotics Autom..
[38] David Furcy,et al. Lifelong Planning A , 2004, Artif. Intell..
[39] Tim Ramsay,et al. Spline smoothing over difficult regions , 2002 .
[40] Hanan Samet,et al. Neighbor finding techniques for images represented by quadtrees , 1982, Comput. Graph. Image Process..
[41] Robert Tibshirani,et al. The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd Edition , 2001, Springer Series in Statistics.
[42] Andrew V. Goldberg,et al. Computing the shortest path: A search meets graph theory , 2005, SODA '05.
[43] Maxim Likhachev,et al. D*lite , 2002, AAAI/IAAI.
[44] Ker-Chau Li,et al. From Stein's Unbiased Risk Estimates to the Method of Generalized Cross Validation , 1985 .
[45] Grace Wahba,et al. Spline Models for Observational Data , 1990 .
[46] Nathan R. Sturtevant,et al. Memory-Based Heuristics for Explicit State Spaces , 2009, IJCAI.
[47] Efstathios Bakolas,et al. A hierarchical on-line path planning scheme using wavelets , 2007, 2007 European Control Conference (ECC).
[48] Haim Kaplan,et al. Reach for A*: Efficient Point-to-Point Shortest Path Algorithms , 2006, ALENEX.
[49] Jonathan Schaeffer,et al. March 2004 7 NEAR OPTIMAL HIERARCHICAL PATHFINDING , 2004 .
[50] Simon N. Wood,et al. Soap film smoothing , 2008 .
[51] Dennis de Champeaux,et al. An Improved Bidirectional Heuristic Search Algorithm , 1975, JACM.
[52] A. Stentz,et al. The Field D * Algorithm for Improved Path Planning and Replanning in Uniform and Non-Uniform Cost Environments , 2005 .
[53] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[54] Panagiotis Tsiotras,et al. Beamlet-like data processing for accelerated path-planning using multiscale information of the environment , 2010, 49th IEEE Conference on Decision and Control (CDC).
[55] Panagiotis Tsiotras,et al. Shortest distance problems in graphs using history-dependent transition costs with application to kinodynamic path planning , 2009, 2009 American Control Conference.
[56] Wheeler Ruml,et al. Searching Without a Heuristic: Efficient Use of Abstraction , 2010, AAAI.
[57] Donald B. Johnson,et al. Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.
[58] I. Johnstone,et al. Ideal spatial adaptation by wavelet shrinkage , 1994 .
[59] Ariel Felner,et al. Theta*: Any-Angle Path Planning on Grids , 2007, AAAI.
[60] Nathan R. Sturtevant,et al. An Analysis of Map-Based Abstraction and Refinement , 2007, SARA.
[61] D. L. Pepyne,et al. Gaming and Price Spikes in Electric Power Markets , 2001, IEEE Power Engineering Review.
[62] Peter Sanders,et al. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.
[63] P. Luh,et al. Selecting input factors for clusters of Gaussian radial basis function networks to improve market clearing price prediction , 2003 .
[64] Dinesh K. Pai,et al. Multiresolution rough terrain motion planning , 1995, Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots.
[65] Anthony Stentz,et al. A Guide to Heuristic-based Path Planning , 2005 .
[66] C. J. Stone,et al. Optimal Global Rates of Convergence for Nonparametric Regression , 1982 .
[67] Anthony Stentz. Optimal and Efficient Path Planning for Unknown and Dynamic Environments , 1993 .
[68] Timothy D. Mount,et al. Predicting price spikes in electricity markets using a regime-switching model with time-varying parameters , 2006 .
[69] A. Rakotomamonjy. Support Vector Machines and Area Under ROC curve , 2004 .
[70] Adi Botea,et al. Breaking Path Symmetries on 4-Connected Grid Maps , 2010, AIIDE.