See this document in CiteSeerX!

Journal of Machine Learning Research 3 (2003) 1307-1331 Submitted 5/02; Published 3/03 Sufficient Dimensionality Reduction  (Make Corrections)  
Amir Globerson Naftali Tishby School ...



  Home/Search   Context   Related

 
View or download:
ai.informatik.uni...n_tishby_2003a.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ai.informatik.unidor...DOKUMENTE (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Dimensionality reduction of empirical co-occurrence data is a fundamental problem in unsupervised learning. It is also a well studied problem in statistics known as the analysis of cross-classified data. One principled approach to this problem is to represent the data in low dimension with minimal loss of (mutual) information contained in the original data. In this paper we introduce an information theoretic nonlinear method for finding such a most informative dimension reduction. (Update)

Similar documents (at the sentence level):
9.6%:   Sufficient Dimensionality Reduction - Globerson, Tishby (2003)   (Correct)
8.6%:   Sufficient Dimensionality Reduction - A novel analysis method - Globerson, Tishby (2002)   (Correct)

Active bibliography (related documents):   More   All
0.5:   The Gifi System Of Descriptive Multivariate Analysis - Michailidis, DE LEEUW (1998)   (Correct)
0.5:   Automated Modeling and Nonlinear Axis Scaling - Leejay Wu (2005)   (Correct)
0.4:   Informative Features in Vision and Learning - Rudra (2002)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ gamir-journal,
  author = "Amir Globerson Gamir",
  title = "Journal of Machine Learning Research 3 (2003) 1307-1331 Submitted 5/02;
    Published 3/03 Sufficient Dimensionality Reduction",
  url = "citeseer.ist.psu.edu/766086.html" }
Citations (may not include all citations):
2319   Elements of information theory (context) - Cover, Thomas - 1991  ACM
568   Indexing by latent semantic analysis - Deerwester, Dumais et al. - 1990  DBLP
376   Text categorization with support vector machines: learning w.. - Joachims - 1998
228   Nonlinear dimensionality reduction by locally linear embeddi.. - Roweis, Saul - 2000
213   A maximum entropy approach to natural language processing - Berger, Della-Pietra et al. - 1996  ACM   DBLP
184   A global geometric framework for nonlinear dimensionality re.. (context) - Tenenbaum, de Silva et al. - 2000
169   Information theory and statistical mechanics (context) - Jaynes - 1957
165   Generalized iterative scaling for log-linear models (context) - Darroch, Ratcliff - 1972
117   Chapman and Hall (context) - Cox, Cox - 1994
113   Learning the parts of objects by non-negative matrix factori.. (context) - Lee, Seung - 1999
107   Efficient noise-tolerant learning from statistical queries - Kearns - 1993  ACM   DBLP
106   The information bottleneck method - Tishby, Pereira et al. - 1999
82   Minimax entropy principle and its application to texture mod.. - Zhu, Wu et al. - 1997  ACM   DBLP
53   Inducing features of random fields - Della-Pietra, Della-Pietra et al. - 1997  ACM   DBLP
49   Agglomerative information bottleneck - Slonim, Tishby - 1999  DBLP
41   Using maximum entropy for text classification - Nigam, Lafferty et al. - 1999
40   Document clustering using word clusters via the information .. - Slonim, Tishby - 2000  ACM   DBLP
38   divergence geometry of probability distributions and minimiz.. (context) - Csiszar - 1975
36   Newsweeder: Learning to filter news (context) - Lang - 1995
34   Unsupervised learning by probabilistic latent semantic analy.. (context) - Hofmann - 2001  ACM   DBLP
27   Reliable communication under channel uncertainty - Lapidoth, Narayan - 1998  DBLP
24   Global coordination of local linear models - Roweis, Saul et al. - 2001  DBLP
21   Methods of Information Geometry (context) - Amari, Nagaoka - 2000
20   A comparison of algorithms for maximum entropy parameter est.. - Malouf - 2002
19   Multivariate information bottleneck - Friedman, Mosenzon et al. - 2001  ACM   DBLP
8   The precision of discriminant functions (context) - Fisher - 1940
7   Sufficient statistics and intrinsic accuracy (context) - Pitman - 1936
5   Simple models for the analysis of association in cross-class.. (context) - Goodman - 1979
4   analysi cros classified data having ordered andor unordered .. (context) - analysis, classified et al. - 1985
3   Features as sufficient statistics - Geiger, Rudra et al. - 1998  ACM   DBLP
3   Analysis of sets of two-way contingency tables using associa.. (context) - Becker, Clogg - 1989
2   Analysis of qulitative data (context) - Haberman - 1978
2   URL http://lanl (context) - Wolf, George et al. - 1999
2   A Probabilistic Thoery of Pattern Recognition (context) - Devroye, Gyorfi et al. - 1996

Documents on the same site (http://www-ai.informatik.uni-dortmund.de/DOKUMENTE):   More
Efficient Kernel Calculation for Multirelational Data - Rüping (2002)   (Correct)
Domain Knowledge and Data Mining Process Decisions - Knobbe, Schipper, Brockhausen (2000)   (Correct)
Text Categorization with Support Vector Machines: Learning with.. - Joachims (1998)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC