Rudi Cilibrasi, Ph.D.
Welcome to my homepage.
Interested in using Git, Subversion, or Mercurial for a private or
commercial development project? The creators of the CompLearn software system
have created a source code repository as well:
Git, Hg (Mercurial), and Svn (Subversion) project hosting over SSH for $4.75/mo with free trial
Dr. Rudi Cilibrasi is available for contract programming work in math, science, optimization, Ruby, C, data compression, and other interesting subjects. Here is Rudi's resume.
Rudi received a PhD in Computer Science
from The University of Amsterdam while working at CWI in Holland. I study issues related to theoretical computer
science and its myriad
applications. My research interests include:
- Computational Complexity, Kolmogorov Complexity, and Data Compression
- Machine Learning and automatic tree reconstruction
- Minimum Description Length and Support Vector Machines
- Applications of the above to bioinformatics, linguistics, and music
Enjoy playing Sudoku, the mathematical puzzle game? Try this
Multiplayer Sudoku Online
Journal Papers
- Rudi Cilibrasi, Leo van Iersel, Steven Kelk and John Tromp, On the complexity of several haplotyping problems, Algorithms in Bioinformatics: 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, LNCS 3692 / 2005, pp. 128-139.
- R. Cilibrasi, Zvi Lotker, Alfredo Navarra, Stephane Perennes, Paul Vitanyi. Lifespan of Peer to Peer Networks, Lecture Notes in Computer Science, Vol. 4305, Springer Verlag, Berlin, 2006, 290-305.
- R. Cilibrasi, L. van Iersel, S. Kelk, J. Tromp. On the complexity of the Single Individual SNP Haplotyping Problem, Algorithmica, 2006.
- R. Cilibrasi, P. Vitanyi. The Google Similarity Distance, IEEE/ACM Transactions on Knowledge and Data Engineering, 19:3(2007), 370-383.>
- R. Cilibrasi, P.M.B. Vitanyi, A New Quartet Tree Heuristic for Hierarchical Clustering, IEEE/ACM Trans. Computat. Biol. Bioinf., Submitted; and was presented at the EUPASCAL Statistics and Optimization of Clustering Workshop, 5-6 Juli 2005, London, UK.
- R. Cilibrasi, P.M.B. Vitanyi, R. de Wolf, Algorithmic clustering of music based on string compression, Computer Music J., 28:4(2004), 49-67.
- R. Cilibrasi, P.M.B. Vitanyi, Clustering by compression, IEEE Trans. Information Theory, 51:4(2005) Also: http://xxx.lanl.gov/abs/cs.CV/031204 (2003).
- R. Cilibrasi Domain Independent Hierarchical Clustering Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica, 2004, nummer 8.
Conference Papers
- R. Cilibrasi, P. Vitanyi. Similarity of Objects and the Meaning of Words, Proc. 3rd Conf. Theory and Applications of Models of Computation (TAMC), 15-20 May, 2006, Beijing, China. Lecture Notes in Computer Science, Vol. 3959, Jin-Yi Cai, S. Barry Cooper, and Angsheng Li (Eds.), 2006, 21.45.
- R. Cilibrasi, R. de Wolf, P. Vitanyi, Algorithmic Clustering of Music, Wedelmusic 2004, Barcelona, Spain http://arxiv.org/archive/cs/0303025
- R. Cilibrasi, Zvi Lotker, Alfredo Navarra, Stephane Perennes, Paul Vitanyi. Lifespan of Peer to Peer Networks: Models and Insight, 10th International Conference On Principles Of Distributed Systems (OPODIS 2006), December 12-15, 2006, Bordeaux Saint-Emilion, France.
- R. Cilibrasi, Leo van Iersel, Steven Kelk and John Tromp, On the complexity of several haplotyping problems, to appear in proceedings of WABI2005.
- R. Cilibrasi, P. Vitanyi. Automatic Extraction of Meaning from the Web. IEEE International Symposium on Information Theory, Seattle, Washington, 2006, 2309-2313.
Unrefereed Papers
- T.Roos, T.Heikki, R.Cilibrasi, P.Myllymaki. Compression-based Stemmatology: A Study of the Legend of St. Henry of Finland, (number HIIT-2005-3), 2005.
- John Tromp, Rudi Cilibrasi, The Limits of Rush-Hour Complexity
-
R. Cilibrasi, P.M.B. Vitanyi, Automatic meaning discovery using Google.
http://xxx.lanl.gov/abs/cs.CL/0412098 (2004)
Write up from New Scientist and Slashdot.
Software
- The CompLearn Toolkit, a suite of software that lets you reproduce the results shown in my Music Clustering paper above, or to try new experiments of your own!
- BLM is the Boolean line manipulator that lets you easily compute set operations using line-oriented files.
- israndom is available for download from the complearn website.
- msrp is available for download from the complearn website. one-liner perl and sed scripts that will change file contents, but msrp is the only one that also changes filenames so that you don't have to do it manually. This is useful when you want to rename symbols that are used within the source code and also used in the file metadata or filename or directory names. By providing a recursive search, msrp saves you a tremendous amount of time when managing symbol sets for larger projects.
Websites
- TsunamiHelp.Info for Tsunami of 2004 relief information
- KatrinaHelp.Info for Hurricane Katrina realtime relief information
- RitaHelp.Info Information for Hurricane Rita
- HCVAction.Org Helping to solve the Hepatitis C epidemic faster
- AsiaQuake.Org Prototype Tsunami Disaster Relief Database and longterm disaster relief preparedness project
Interests
- I am Rudi, I like Ruby, you should, too!
- mpi_ruby, a Ruby binding for MPI, a supercomputer programming system
- rubysvm, a Ruby binding for libsvm, a powerful machine learning system using Support Vector Machines
- An autoconfigure enabled version of the NIST Special Database 19 for Optical Character Recognition
- A version of Reactive Keyboard that compiles for Linux (a tool for predictive keyboard input, especially useful for anybody who thinks faster than they type
- ᇔ
- I recently found out my Erdos number is 3:
- Rudi Cilibrasi -- John Tromp -- Jeffrey Outlaw Shallit -- Paul Erdos
- My resume is here.