| 2013 | ||
|---|---|---|
| i9 | Nir Friedman, Ori Mosenzon, Noam Slonim, Naftali Tishby: Multivariate Information Bottleneck. CoRR abs/1301.2270 (2013) | |
| 2012 | ||
| c63 | ||
| i8 | Sivan Sabato, Nati Srebro, Naftali Tishby: Characterizing the Sample Complexity of Large-Margin Learning With Second-Order Statistics. CoRR abs/1204.1276 (2012) | |
| i7 | Amir Globerson, Naftali Tishby: The Minimum Information Principle for Discriminative Learning. CoRR abs/1207.4110 (2012) | |
| i6 | Amir Globerson, Gal Chechik, Naftali Tishby: Sufficient Dimensionality Reduction with Irrelevant Statistics. CoRR abs/1212.2483 (2012) | |
| 2011 | ||
| j27 | Simone Calderara, Uri Heinemann, Andrea Prati, Rita Cucchiara, Naftali Tishby: Detecting anomalies in people's trajectories using spectral graph analysis. Computer Vision and Image Understanding 115(8): 1099-1111 (2011) | |
| j26 | Ohad Shamir, Naftali Tishby: Spectral Clustering on a Budget. Journal of Machine Learning Research - Proceedings Track 15: 661-669 (2011) | |
| i5 | Sivan Sabato, Naftali Tishby: Multi-Instance Learning with Any Hypothesis Class. CoRR abs/1107.2021 (2011) | |
| 2010 | ||
| j25 | Sivan Sabato, Nathan Srebro, Naftali Tishby: Reducing Label Complexity by Learning From Bags. Journal of Machine Learning Research - Proceedings Track 9: 685-692 (2010) | |
| j24 | Yevgeny Seldin, Naftali Tishby: PAC-Bayesian Analysis of Co-clustering and Beyond. Journal of Machine Learning Research 11: 3595-3646 (2010) | |
| j23 | Ohad Shamir, Naftali Tishby: Stability and model selection in k-means clustering. Machine Learning 80(2-3): 213-243 (2010) | |
| j22 | Ohad Shamir, Sivan Sabato, Naftali Tishby: Learning and generalization with the information bottleneck. Theor. Comput. Sci. 411(29-30): 2696-2711 (2010) | |
| c62 | Sivan Sabato, Nathan Srebro, Naftali Tishby: Tight Sample Complexity of Large-Margin Learning. NIPS 2010: 2038-2046 | |
| i4 | Sivan Sabato, Nathan Srebro, Naftali Tishby: Tight Sample Complexity of Large-Margin Learning. CoRR abs/1011.5053 (2010) | |
| 2009 | ||
| j21 | Yevgeny Seldin, Naftali Tishby: PAC-Bayesian Generalization Bound for Density Estimation with Application to Co-clustering. Journal of Machine Learning Research - Proceedings Track 5: 472-479 (2009) | |
| c61 | Sivan Sabato, Naftali Tishby: Homogeneous Multi-Instance Learning with Arbitrary Dependence. COLT 2009 | |
| c60 | Ron M. Hecht, Omer Hezroni, Amit Manna, Gil Dobry, Yaniv Zigel, Naftali Tishby: Information bottleneck based age verification. INTERSPEECH 2009: 188-191 | |
| c59 | Ron M. Hecht, Elad Noor, Naftali Tishby: Speaker recognition by Gaussian information bottleneck. INTERSPEECH 2009: 1567-1570 | |
| 2008 | ||
| j20 | Eyal Krupka, Naftali Tishby: Generalization from Observed to Unobserved Features by Clustering. Journal of Machine Learning Research 9: 339-370 (2008) | |
| c58 | Ohad Shamir, Sivan Sabato, Naftali Tishby: Learning and Generalization with the Information Bottleneck. ALT 2008: 92-107 | |
| c57 | Ohad Shamir, Naftali Tishby: Model Selection and Stability in k-means Clustering. COLT 2008: 367-378 | |
| c56 | Yevgeny Seldin, Naftali Tishby: Multi-classification by categorical features via clustering. ICML 2008: 920-927 | |
| c55 | ||
| c54 | Ohad Shamir, Naftali Tishby: On the Reliability of Clustering Stability in the Large Sample Regime. NIPS 2008: 1465-1472 | |
| 2007 | ||
| j19 | Eyal Krupka, Naftali Tishby: Incorporating Prior Knowledge on Features into Learning. Journal of Machine Learning Research - Proceedings Track 2: 227-234 (2007) | |
| j18 | Amir Globerson, Gal Chechik, Fernando Pereira, Naftali Tishby: Euclidean Embedding of Co-occurrence Data. Journal of Machine Learning Research 8: 2265-2295 (2007) | |
| j17 | Hani Neuvirth, Uri Heinemann, David Birnbaum, Naftali Tishby, Gideon Schreiber: ProMateus - an open research approach to protein-binding sites analysis. Nucleic Acids Research 35(Web-Server-Issue): 543-548 (2007) | |
| c53 | ||
| 2006 | ||
| j16 | Noam Slonim, Nir Friedman, Naftali Tishby: Multivariate Information Bottleneck. Neural Computation 18(8): 1739-1789 (2006) | |
| c52 | Amir Globerson, Gal Chechik, Fernando Pereira, Naftali Tishby: Embedding Heterogeneous Data Using Statistical Models. AAAI 2006: 1605-1608 | |
| c51 | Yevgeny Seldin, Noam Slonim, Naftali Tishby: Information Bottleneck for Non Co-Occurrence Data. NIPS 2006: 1241-1248 | |
| 2005 | ||
| j15 | Gal Chechik, Amir Globerson, Naftali Tishby, Yair Weiss: Information Bottleneck for Gaussian Variables. Journal of Machine Learning Research 6: 165-188 (2005) | |
| c50 | Ron M. Hecht, Naftali Tishby: Extraction of relevant speech features using the information bottleneck method. INTERSPEECH 2005: 353-356 | |
| c49 | ||
| c48 | ||
| c47 | Amir Navot, Lavi Shpigelman, Naftali Tishby, Eilon Vaadia: Nearest Neighbor Based Feature Selection for Regression and its Application to Neural Activity. NIPS 2005 | |
| c46 | Amir Navot, Ran Gilad-Bachrach, Yiftah Navot, Naftali Tishby: Is Feature Selection Still Necessary? SLSFS 2005: 127-138 | |
| 2004 | ||
| j14 | Gill Bejerano, Nir Friedman, Naftali Tishby: Efficient Exact p-Value Computation for Small Sample, Sparse, and Surprising Categorical Data. Journal of Computational Biology 11(5): 867-886 (2004) | |
| c45 | Ran Gilad-Bachrach, Amir Navot, Naftali Tishby: Bayes and Tukey Meet at the Center Point. COLT 2004: 549-563 | |
| c44 | Ran Gilad-Bachrach, Amir Navot, Naftali Tishby: Margin based feature selection - theory and algorithms. ICML 2004 | |
| c43 | Amir Globerson, Gal Chechik, Fernando C. Pereira, Naftali Tishby: Euclidean Embedding of Co-Occurrence Data. NIPS 2004 | |
| c42 | Amir Globerson, Naftali Tishby: The Minimum Information Principle for Discriminative Learning. UAI 2004: 193-200 | |
| 2003 | ||
| j13 | Noam Slonim, Gill Bejerano, Shai Fine, Naftali Tishby: Discriminative Feature Selection via Multiclass Variable Memory Markov Model. EURASIP J. Adv. Sig. Proc. 2003(2): 93-102 (2003) | |
| j12 | Ron Bekkerman, Ran El-Yaniv, Naftali Tishby, Yoad Winter: Distributional Word Clusters vs. Words for Text Categorization. Journal of Machine Learning Research 3: 1183-1208 (2003) | |
| j11 | Amir Globerson, Naftali Tishby: Sufficient Dimensionality Reduction. Journal of Machine Learning Research 3: 1307-1331 (2003) | |
| c41 | ||
| c40 | Ran Gilad-Bachrach, Amir Navot, Naftali Tishby: An Information Theoretic Tradeoff between Complexity and Accuracy. COLT 2003: 595-609 | |
| c39 | Naftali Tishby: Efficient Data Representations That Preserve Information. Discovery Science 2003: 45 | |
| c38 | Gal Chechik, Amir Globerson, Naftali Tishby, Yair Weiss: Information Bottleneck for Gaussian Variables. NIPS 2003 | |
| c37 | Amir Globerson, Gal Chechik, Naftali Tishby: Sufficient Dimensionality Reduction with Irrelevance Statistics. UAI 2003: 281-288 | |
| 2002 | ||
| j10 | Shlomo Dubnov, Ran El-Yaniv, Yoram Gdalyahu, Elad Schneidman, Naftali Tishby, Golan Yona: A New Nonparametric Pairwise Clustering Algorithm Based on Iterative Estimation of Distance Profiles. Machine Learning 47(1): 35-61 (2002) | |
| c36 | ||
| c35 | Amir Globerson, Naftali Tishby: Sufficient Dimensionality Reduction - A novel Analysis Method. ICML 2002: 203-210 | |
| c34 | Noam Slonim, Gill Bejerano, Shai Fine, Naftali Tishby: Discriminative Feature Selection via Multiclass Variable Memory Markov Model. ICML 2002: 578-585 | |
| c33 | Koby Crammer, Ran Gilad-Bachrach, Amir Navot, Naftali Tishby: Margin Analysis of the LVQ Algorithm. NIPS 2002: 462-469 | |
| c32 | Gal Chechik, Naftali Tishby: Extracting Relevant Structures with Side Information. NIPS 2002: 857-864 | |
| c31 | Noam Slonim, Nir Friedman, Naftali Tishby: Unsupervised document classification using sequential information maximization. SIGIR 2002: 129-136 | |
| 2001 | ||
| j9 | Gill Bejerano, Yevgeny Seldin, Hanah Margalit, Naftali Tishby: Markovian domain fingerprinting: statistical segmentation of protein sequences. Bioinformatics 17(10): 927-934 (2001) | |
| j8 | William Bialek, Ilya Nemenman, Naftali Tishby: Predictability, Complexity, and Learning. Neural Computation 13(11): 2409-2463 (2001) | |
| j7 | Itay Gat, Naftali Tishby: Spotting Neural Spike Patterns Using an Adversary Background Model. Neural Computation 13(12): 2681-2708 (2001) | |
| c30 | Yevgeny Seldin, Gill Bejerano, Naftali Tishby: Unsupervised Sequence Segmentation by a Mixture of Switching Variable Memory Markov Sources. ICML 2001: 513-520 | |
| c29 | Gal Chechik, Amir Globerson, M. J. Anderson, E. D. Young, Israel Nelken, Naftali Tishby: Group Redundancy Measures Reveal Redundancy Reduction in the Auditory Pathway. NIPS 2001: 173-180 | |
| c28 | Noam Slonim, Nir Friedman, Naftali Tishby: Agglomerative Multivariate Information Bottleneck. NIPS 2001: 929-936 | |
| c27 | Ron Bekkerman, Ran El-Yaniv, Yoad Winter, Naftali Tishby: On Feature Distributional Clustering for Text Categorization. SIGIR 2001: 146-153 | |
| c26 | Nir Friedman, Ori Mosenzon, Noam Slonim, Naftali Tishby: Multivariate Information Bottleneck. UAI 2001: 152-161 | |
| 2000 | ||
| c25 | Shahar Mendelson, Naftali Tishby: Statistical Sufficiency for Classes in Empirical L2 Spaces. COLT 2000: 81-89 | |
| c24 | Gal Chechik, Naftali Tishby: Temporally Dependent Plasticity: An Information Theoretic Account. NIPS 2000: 110-116 | |
| c23 | Elad Schneidman, Naama Brenner, Naftali Tishby, Robert R. de Ruyter van Steveninck, William Bialek: Universality and Individuality in a Neural Code. NIPS 2000: 159-165 | |
| c22 | Naftali Tishby, Noam Slonim: Data Clustering by Markovian Relaxation and the Information Bottleneck Method. NIPS 2000: 640-646 | |
| c21 | Noam Slonim, Naftali Tishby: Document clustering using word clusters via the information bottleneck method. SIGIR 2000: 208-215 | |
| i3 | Naftali Tishby, Fernando C. Pereira, William Bialek: The information bottleneck method. CoRR physics/0004057 (2000) | |
| i2 | William Bialek, Ilya Nemenman, Naftali Tishby: Predictability, complexity and learning. CoRR physics/0007070 (2000) | |
| 1999 | ||
| c20 | Elad Schneidman, Idan Segev, Naftali Tishby: Information Capacity and Robustness of Stochastic Neuron Models. NIPS 1999: 178-184 | |
| c19 | ||
| 1998 | ||
| j6 | Dana Ron, Yoram Singer, Naftali Tishby: On the Learnability and Usage of Acyclic Probabilistic Finite Automata. J. Comput. Syst. Sci. 56(2): 133-152 (1998) | |
| j5 | Shai Fine, Yoram Singer, Naftali Tishby: The Hierarchical Hidden Markov Model: Analysis and Applications. Machine Learning 32(1): 41-62 (1998) | |
| c18 | Golan Yona, Nathan Linial, Naftali Tishby, Michal Linial: A Map of the Protein Space: An Automatic Hierarchical Classification of all Protein Sequences. ISMB 1998: 212-221 | |
| c17 | ||
| c16 | Dmitry Rinberg, Hanan Davidowitz, Naftali Tishby: Multi-Electrode Spike Sorting by Clustering Transfer Functions. NIPS 1998: 146-152 | |
| c15 | Catriel Beeri, Gershon Elber, Tova Milo, Yehoshua Sagiv, Oded Shmueli, Naftali Tishby, Yakov A. Kogan, David Konopnicki, Pini Mogilevski, Noam Slonim: WebSuite: A Tool Suite for Harnessing Web Data. WebDB 1998: 152-171 | |
| 1997 | ||
| j4 | Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby: Selective Sampling Using the Query by Committee Algorithm. Machine Learning 28(2-3): 133-168 (1997) | |
| c14 | ||
| 1996 | ||
| j3 | Dana Ron, Yoram Singer, Naftali Tishby: The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length. Machine Learning 25(2-3): 117-149 (1996) | |
| j2 | David Haussler, Michael J. Kearns, H. Sebastian Seung, Naftali Tishby: Rigorous Learning Curve Bounds from Statistical Mechanics. Machine Learning 25(2-3): 195-236 (1996) | |
| i1 | Fernando C. N. Pereira, Yoram Singer, Naftali Tishby: Beyond Word N-Grams. CoRR cmp-lg/9607016 (1996) | |
| 1995 | ||
| c13 | Dana Ron, Yoram Singer, Naftali Tishby: On the Learnability and Usage of Acyclic Probabilistic Finite Automata. COLT 1995: 31-40 | |
| 1994 | ||
| j1 | Yoram Singer, Naftali Tishby: Dynamical encoding of cursive handwriting. Biological Cybernetics 71(3): 227-237 (1994) | |
| c12 | Dana Ron, Yoram Singer, Naftali Tishby: Learning Probabilistic Automata with Variable Memory Length. COLT 1994: 35-46 | |
| c11 | David Haussler, H. Sebastian Seung, Michael J. Kearns, Naftali Tishby: Rigorous Learning Curve Bounds from Statistical Mechanics. COLT 1994: 76-87 | |
| c10 | Daphna Weinshall, Michael Werman, Naftali Tishby: Stability and Likelihood of Views of Three Dimensional Objects. ECCV (1) 1994: 24-35 | |
| c9 | Daphna Weinshall, Michael Werman, Naftali Tishby: Stability and Likelihood of Views of Three Dimensional Objects. Theoretical Foundations of Computer Vision 1994: 237-256 | |
| 1993 | ||
| c8 | Fernando C. N. Pereira, Naftali Tishby, Lillian Lee: Distributional Clustering of English Words. ACL 1993: 183-190 | |
| c7 | ||
| c6 | Scott Kirkpatrick, Géza Györgyi, Naftali Tishby, Lidror Troyansky: The Statistical Mechanics of k-Satisfaction. NIPS 1993: 439-446 | |
| c5 | ||
| 1992 | ||
| c4 | Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby: Information, Prediction, and Query by Committee. NIPS 1992: 483-490 | |
| c3 | ||
| 1991 | ||
| c2 | H. Sebastian Seung, Haim Sompolinsky, Naftali Tishby: Learning Curves in Large Neural Networks. COLT 1991: 112-127 | |
| 1989 | ||
| c1 | Esther Levin, Naftali Tishby, Sara A. Solla: A Statistical Approach to Learning and Generalization in Layered Neural Networks. COLT 1989: 245-260 | |
Colors in the list of coauthors
Last update Sat May 25 20:29:32 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page