Photo of Prof. Ran El-Yaniv

Prof. Ran El-Yaniv

Contact information
Office Hours:
Sunday, 16:30-17:30
Research interests
Statistical learning theory, data clustering and compression, applications to information retrieval, Web mining, human-computer interaction, biological sequence analysis, texture analysis and synthesis, and music analysis and synthesis; Online algorithms: Design, theoretical analysis and practical experimentation. Computational finance: Portfolio selection algorithms.
Selected publications
  • A. Borodin and R. El-Yaniv.
    Online Computation and Competitive Analysis, Cambridge University Press, 1998.
  • R. Bekkerman, R. El-Yaniv and A. McCallum.
    Multi-Way Distributional Clustering via Pairwise Interactions.
    In Proceedings of the 22nd International Conference on Machine Learning (ICML), 41--48, 2005 [bibtex]
  • R. Begleiter and R. El-Yaniv.
    Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition.
    No. CS-2005-13, Technion - Israel Institute of Technology, 2005 [bibtex]
  • P. Derbeko, R. El-Yaniv and R. Meir.
    Explicit Learning Curves for Transductive Learning and Application to Clustering and Compression Algorithms.
    Journal of Artificial Intelligence Research (JAIR), 22:117--142, 2004 [bibtex]
  • A. Borodin, R. El-Yaniv and V. Gogan.
    Can We Learn to Beat the Best Stock.
    Journal of Artificial Intelligence Research, 21:579-594, 2004 [bibtex]
  • R. El-Yaniv, A. Fiat, R.M. Karp and G. Turpin.
    Optimal Search and One-Way Trading Online Algorithms.
    Algorithmica, 30(1):101--139, 2001 [bibtex]
  • R. El-Yaniv and R.M. Karp.
    Nearly Optimal Competitive Online Replacement Policies.
    Mathematics of Operations Research, 22(4):814--839, 1997 [bibtex]