
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ashok N. Srivastava, Renjeng Su, Andreas S. Weigend, "Data Mining for Features Using ScaleSensitive Gated Experts," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 12, pp. 12681279, December, 1999.  
BibTex  x  
@article{ 10.1109/34.817407, author = {Ashok N. Srivastava and Renjeng Su and Andreas S. Weigend}, title = {Data Mining for Features Using ScaleSensitive Gated Experts}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {21}, number = {12}, issn = {01628828}, year = {1999}, pages = {12681279}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.817407}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Data Mining for Features Using ScaleSensitive Gated Experts IS  12 SN  01628828 SP1268 EP1279 EPD  12681279 A1  Ashok N. Srivastava, A1  Renjeng Su, A1  Andreas S. Weigend, PY  1999 KW  Mixture of experts KW  mixture model KW  classification and regression KW  time series segmentation KW  neural networks. VL  21 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
Abstract—This article introduces a new tool for exploratory data analysis and data mining called
[1] M. Basseville and I.V. Nikiforov, Detection of Abrupt Changes: Theory and Application. Prentice Hall, 1993.
[2] T.M. Cover and J.A. Thomas, Elements of Information Theory. John Wiley&Sons, 1991.
[3] R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis. Wiley, 1973.
[4] R. Durbin and D. Willshaw, “An Analogue Approach to the Travelling Salesman Problem Using an Elastic Net Method,” Nature, pp. 689691, 1987.
[5] C. Fancourt and J. Principe, “A Neighborhood Map of Competing One Step Predictors for Piecewise Segmentation and Identification of Time Series,” Proc Int'l Conf. Neural Netorks, 1996.
[6] N. Gershenfeld, “Nonlinear Inference and ClusterWeighted Modeling,” Proc. 1995 Florida Workshop Nonlinear Astronomy, vol. 1, pp. 16, 1995.
[7] S. Guiasu, Information Theory with Applications. McGrawHill, 1977.
[8] J. Hertz, A. Krogh, and R.G. Palmer, Introduction to the Theory of Neural Computation. AddisonWesley, 1991.
[9] R.A. Jacobs and M.I. Jordan, “Learning Piecewise Control Strategies in a Modular Network Architecture,” IEEE Trans. Systems, Man, and Cybernetics, 1993.
[10] R.A. Jacobs, M.I. Jordan, S.J. Nowlan, and G.E. Hinton, “Adaptive Mixtures of Local Experts,” Neural Computation, vol. 3, pp. 7987, 1991.
[11] M.I. Jordan and R.A. Jacobs, “Hierarchical Mixtures of Experts and the EM Algorithm,” Neural Computation, vol. 6, pp. 181214, 1994.
[12] P. McCullagh and J.A. Nelder, Generalized Linear Models. London. Chapman and Hall, 1989.
[13] K. Pawelzik, J. Kohlmorgen, and K.R. Müller, “Annealed Competition of Experts for a Segmentation and Classification of Switching Dynamics,” Neural Computation, vol. 8, no. 2 pp. 340356, 1996.
[14] R.E. Quandt, “The Estimation of the Parameters of a Linear Regression System Obeying Two Separate Regimes,” J. Am. Statistical Assoc., pp. 873880, 1958.
[15] C.R. Rao, Linear Statistical Inference and its Applications. New York: John Wiley and Sons, 1965.
[16] K. Rose, E. Gurewitz, and G.C. Fox, “Statistical Mechanics and Phase Transitions in Clustering, Physical Rev. Letters,” vol. 65, no. 8, pp. 945948, 1990.
[17] D.E. Rumelhart, R. Durbin, R. Golden, and Y. Chauvin, “Backpropagation: The Basic Theory,” Backpropagation: Theory, Architectures, and Applications, Y. Chauvin and D.E. Rumelhart, eds., pp. 134, Hillsdale, N.J.: Lawrence Erlbaum Assoc., 1995.
[18] S. Shi, “Modeling the Temporal Structure of Time with Hidden Markov Experts,” PhD thesis, Dept. of Computer Science, Univ. of Colorado, 1998.
[19] L.W. Swokowski, Calculus with Analytic Geometry. Prindle Weber and Schmidt, 1984.
[20] F. Takens, “Detecting Strange Attractors in Turbulence,” Dynamical Systems and Turbulence, D.A. Rand, and L.S. Young, eds. Lecture Notes in Mathematics, vol. 898, pp. 366381, Springer, 1981.
[21] Time Series Prediction: Forecasting the Future and Understanding the Past. A.S. Weigend and N.A. Gershenfeld, eds., Reading, Mass.: AddisonWesley, 1994.
[22] A.S. Weigend, M. Mangeas, and A.N. Srivastava, “Nonlinear Gated Experts for Time Series: Discovering Regimes and Avoiding Overfitting,” Int'l J. Neural Systems, vol. 6, pp. 373399, 1995.
[23] Y.F. Wong, “Clustering Data by Melting,” Neural Computation, vol. 5, no. 1, pp. 89104, 1993.