
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ian T. Nabney, Yi Sun, Peter Tino, Ata Kab?, "Semisupervised Learning of Hierarchical Latent Trait Models for Data Visualization," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 3, pp. 384400, March, 2005.  
BibTex  x  
@article{ 10.1109/TKDE.2005.49, author = {Ian T. Nabney and Yi Sun and Peter Tino and Ata Kab?}, title = {Semisupervised Learning of Hierarchical Latent Trait Models for Data Visualization}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {17}, number = {3}, issn = {10414347}, year = {2005}, pages = {384400}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2005.49}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Semisupervised Learning of Hierarchical Latent Trait Models for Data Visualization IS  3 SN  10414347 SP384 EP400 EPD  384400 A1  Ian T. Nabney, A1  Yi Sun, A1  Peter Tino, A1  Ata Kab?, PY  2005 KW  Hierarchical model KW  latent trait model KW  magnification factors KW  data visualization KW  document mining. VL  17 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] F. Aurenhammer, “Voronoi Diagrams— Survey of a Fundamental Geometric Data Structure,” ACM Computing Surveys, vol. 3, pp. 345405, 1991.
[2] O. BarndorffNielsen, Information and Exponential Families in Statistical Theory. Wiley, 1978.
[3] J. Bernardo and A. Smith, Bayesian Theory. Chichester, U.K.: J. Wiley & Sons, 1994.
[4] C.M. Bishop, M. Svensén, and C.K.I. Williams, “GTM: The Generative Topographic Mapping,” Neural Computation, vol. 10, no. 1, pp. 215235, 1998.
[5] C.M. Bishop, M. Svensén, and C.K.I Williams, “Developments of the Generate Topographic Mapping,” Neurocomputing, vol. 21, pp. 203224, 1998.
[6] C.M. Bishop, M. Svensén, and C.K.I. Williams, “Magnification Factors for the GTM Algorithm,” Proc. IEE Fifth Int'l Conf. Artificial Neural Networks, pp. 6469, 1997.
[7] C.M. Bishop and M.E. Tipping, “A Hierarchical Latent Variable Model for Data Visualization,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 3, pp. 281293, 1998.
[8] D.M. Boulton and C.S. Wallace, “An Information Measure for Hierarchic Classification,” Computer J., vol. 16, no. 3, pp. 254261, 1973.
[9] G. Celeux, S. Chrétien, F. Forbes, and A. Mkhadri, “A ComponentWise EM Algorithm for Mixtures,” J. Computational and Graphical Statistics, vol. 10, pp. 699712, 2001.
[10] A.P. Dempster, N.M. Laird, and D.B. Rubin, “Maximum Likelihood from Incomplete Data via the EM Algorithm,” J. Royal Statistical Soc., Series B, vol. 39, pp. 138, 1977.
[11] M. Figueiredo and A.K. Jain, “Unsupervised Learning of Finite Mixture Models,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, pp. 381396, 2002.
[12] P. Horton and K. Nakai, “A Probabilistic Classification System for Predicting the Cellular Localization Sites of Proteins,” Intelligent System in Molecular Biology, vol. 4, pp. 109115, 1996.
[13] A. Inselberg and B. Dimsdale, “Parallel Coordinates: A Tool for Visualizing Mulitdimensional Geometry,” Proc. Visualization '90, pp. 36178, 1990.
[14] A. Kabán and M. Girolami, “A Combined Latent Class and Trait Model for the Analysis and Visualization of Discrete Data,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 8, pp. 859872, Aug. 2001.
[15] A. Kabán, P. Tiňo, and M. Girolami, “A General Framework for a Principled Hierarchical Visualisation of Multivariate Data,” Proc. Third Int'l Conf. Intelligent Data Eng. and Automated Learning (IDEAL '02), pp. 1723, 2002.
[16] D.A. Keim, H.P. Kriegel, and M. Ankerst, “Recursive Pattern: A Technique for Visualizing Very Large Amounts of Data,” Proc. Sixth IEEE Visualization 1995 Conf. (VIS '95), pp. 279286, 1995.
[17] T. Kohonen, “The SelfOrganizing Map,” Proc. IEEE, vol. 78, no. 9, pp. 14641479, 1990.
[18] T. Kohonen, SelfOrganizing Maps. Berlin: SpringerVerlag, 1999.
[19] Y. Koren and D. Harel, “A TwoWay Visualization Method for Clustered Data,” Proc. Ninth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 589594, 2003.
[20] J. LeBlanc, M.O. Ward, and N. Wittels, “Exploring nDimensional Databases,” Proc. Visualization '90, pp. 230237, 1990.
[21] P. McCullagh and L. Nelder, Generalized Linear Models. Chapman and Hall, 1985.
[22] R. Miikkulainen, “Script Recognition with Hierarchical Feature Maps,” Connection Science, vol. 2, pp. 83101, 1990.
[23] E. Pampalk, W. Goebl, and G. Widmer, “Visualising Changes in the Structure of Data for Exploratory Feature Selection,” Proc. 2003 ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '03), P. Domingos et al., eds., pp. 157166, 2003.
[24] W. Ribarsky, E. Ayers, J. Eble, and S. Mukherjea, “Glyphmaker: Creating Customized Visualization of Complex Data,” Computer, vol. 27, vol. 7, pp. 5764, July 1994.
[25] S.J. Roberts, C. Holmes, and D. Denison, “MinimumEntropy Data Partitioning Using Reversible Jump Markov Chain MonteCarlo,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, pp. 909914, 2001.
[26] C. Stein, “Approximation of Improper Prior Measures by Proper Probability Measures,” Bernoulli, Bayes, Laplace Festschrift. (J. Neyman and L. LeCam, eds.)., Berlin: Springer, pp. 217240, 1965.
[27] P. Tiňo and I.T. Nabney, “Hierarchical GTM: Constructing Localized Nonlinear Projection Manifolds in a Principled Way,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, pp. 639656, 2002.
[28] C.S. Wallace and D.L. Dowe, “Minimum Message Length and Kolmogorov Complexity,” The Computer J., vol. 42, pp. 270283, 1999.
[29] C.S. Wallace and D.M. Boulton, “An Information Measure for Classification,” The Computer J., vol. 11, no. 2, pp. 185194, 1968.
[30] C.S. Wallace and D.L. Dowe, “Intrinsic Classification by MML— the Snob Program,” Proc. Seventh Australian Joint Conf. Artificial Intelligence, C. Zhang et al., eds., World Scientific, pp. 3744, 1994.
[31] C.S. Wallace and D.L. Dowe, “Refinements of MDL and MML Coding,” Computer J., vol. 42, no. 4, pp. 330337, 1999.
[32] C.S. Wallace and D.L. Dowe, “MML Clustering of MultiState, Poisson, Von Mises Circular and Gaussian Distributions,” Statistics and Computing, vol. 10, pp. 7383, 2000.
[33] C.S. Wallace and P.R. Freeman, “Estimation and Inference by Compact Coding,” J. Royal Statistical Soc., series B, vol. 49, pp. 240265, 1987.
[34] E.J. Wegman, “Hyperdimensional Data Analysis Using Parallel Coordinates,” J. Am. Statistical Assoc., vol. 411, no. 85, p. 664, 1990.
[35] R. Wolke and H. Schwetlick, “Iterative Reweighted Least Squares: Algorithms, Convergence Analysis, and Numerical Comparisons,” SIAM J. Scientific and Statistical Computing, vol. 9, no. 5, pp. 907921, 1999.
[36] J. Yang, M.O. Ward, and E.A. Rundensteiner, “Interactive Hierarchical Displays: A General Framework for Visualisation and Exploration of Large Multivariate Data Sets,” Computers and Graphics J., vol. 27, pp. 265283, 2002.