http:^^www.cs.jhu.edu^~salzberg^

来自「This data set contains WWW-pages collect」· EDU^~SALZBERG^ 代码 · 共 227 行

EDU^~SALZBERG^
227
字号
Date: Wed, 20 Nov 1996 23:03:59 GMT
Server: NCSA/1.5.1
Last-modified: Mon, 18 Nov 1996 17:51:45 GMT
Content-type: text/html
Content-length: 8959

<title> Steven Salzberg's home page </title><table WIDTH=600 CELLPADDING=0 CELLSPACING=2 BORDER=0><tr><td WIDTH=250 VALIGN=TOP><center><!WA0><a href="http://www.cs.jhu.edu/~salzberg/salzberg-small.gif"><!WA1><IMG align=left border=1    SRC="http://www.cs.jhu.edu/~salzberg/salzberg-small.gif"></a></center></td><td VALIGN=TOP WIDTH=380><p><hr><h2> Steven Salzberg's home page </h2><hr><p><h4> My research interests include computational biology and machine learning. </h4><address>Steven Salzberg, Associate Professor, Department of Computer Science, Johns Hopkins University, Baltimore, MD 21218. <br>Phone: 410-516-8438 Fax: 410-516-6134 <br>Email: <!WA2><a href="mailto:salzberg@cs.jhu.edu">salzberg@cs.jhu.edu</a><p></address></td></tr></table><h2> Selected papers </h2><ol> <li> <!WA3><a href = "http://www.cs.jhu.edu/~salzberg/veil.ps"> Finding Genes in Human DNA with a Hidden Markov Model</a> byJ. Henderson, S. Salzberg, and K. Fasman.  This describes theVEIL system for finding genes.  Technical Report 1996-02, Department of Computer Science, Johns Hopkins University, January 1996.Under submission; please contact me before referencing this paper.<li> <!WA4><a href = "http://www.cs.jhu.edu/~salzberg/exons.ps.gz"> Locating Protein Coding Regions in Human DNA using a Decision TreeAlgorithm.</a>  <I>Journal of Computational Biology</I>,2:3 (1995), 473-485. (590K, PostScript compressed with gzip)(If you have trouble retrieving this paper, click <!WA5><a href="ftp://condor.cs.jhu.edu/pub/salzberg/exons.ps.gz">here</a>to use ftp instead of http.)<li> <!WA6><a href = "ftp://condor.cs.jhu.edu/pub/salzberg/starcr.ps.gz"> Decision Trees for Automated Identification of Cosmic Ray Hits inHubble Space Telescope Images</a> by S. Salzberg, R. Chandar, H. Ford, S. Murthy, and R. White. <I>Publications of the AstronomicalSociety of the Pacific</I> 107, May 1995, 1-10. (460K, compressedPostscript)<li> <!WA7><a href = "http://www.cs.jhu.edu/~salzberg/critique.ps"> On Comparing Classifiers: A Critique of Current Research and Methods</a>  Technical Report JHU-95/06, Department ofComputer Science, Johns Hopkins University, May 1995.  Draft manuscript (139K, Postscript)<li> <!WA8><a href = "ftp://condor.cs.jhu.edu/pub/salzberg/lookahead.ps">Lookahead and Pathology in Decision Tree Induction.</a> by S.K. Murthyand S. Salzberg. <I>Proceedings of IJCAI-95</I>, Montreal, pp. 1025--1031.<li> <!WA9><a href = "http://www.cs.jhu.edu/~salzberg/jair94.ps"> A System for Induction of Oblique Decision Trees</a> by S.K. Murthy, S. Kasif, and S. Salzberg.<I>Journal of Artificial Intelligence Research</I> 2:1 (1994), 1-32.(475K, PostScript)<li> <!WA10><a href = "http://www.cs.jhu.edu/~salzberg/ml94.ps"> Towards a Better Understanding of Memory-Basedand Bayesian Classifiers</a> by J. Rachlin, S. Kasif, S. Salzberg, and D. Aha. <I> Proc. 1994 Internatl. Conf. on Machine Learning</I>(pp. 242--250).  New Brunswick, NJ, July 1994.<li> <!WA11><a href = "http://www.cs.jhu.edu/~salzberg/bestcase.ps"> Best-Case Results for Nearest-NeighborLearning</a> by S. Salzberg, A. Delcher, D. Heath, and S. Kasif.<I>IEEE Transactionson Pattern Analysis and Machine Intelligence</I> 17:6, June 1995,599-608.  (Earlier version, "Learning with a Helpful Teacher," appearedin the <I>IJCAI-91</I> proceedings.)  (333K, PostScript)<li> <!WA12><a href = "http://www.cs.jhu.edu/~salzberg/book-review.ps"> Book Review</a> of <I>C4.5: Programs for Machine Learning</I> (by J.R. Quinlan).  <I>Machine Learning</I> 16 (1994), 235-240. (89K, PostScript)<li> <!WA13><a href = "http://www.cs.jhu.edu/~salzberg/aaai.ps"> OC1: Randomized Induction of Oblique Decision Trees</a>  by S.K. Murthy, S. Kasif, S. Salzberg, and R. Beigel <I>Proc. of the Eleventh National Conf. on ArtificialIntelligence (AAAI-93)</I> (pp. 322--327), Washington, D.C., 1993.(141K, Postscript)<li> <!WA14><a href = "http://www.cs.jhu.edu/~salzberg/ijcai93.ps"> Learning Oblique Decision Trees</a> byD. Heath, S. Kasif, and S. Salzberg.  Describes a simulated annealingsystem for building decision trees.   <I>Proc. 13thInternatl. Joint Conf. on Artificial Intelligence (IJCAI-93)</I>(pp. 1002--1007). Chambery, France, 1993. (147K, PostScript)<li> <!WA15><a href = "http://www.cs.jhu.edu/~salzberg/mlj93.dvi"> A Weighted Nearest Neighbor Algorithm forLearning with Symbolic Features</a> by S. Cost and S. Salzberg. Machine Learning 10:1, 1993, 57--78. Some figures missing. (103K, DVI format)<li> <!WA16><a href = "http://www.cs.jhu.edu/~salzberg/committees.ps"> Committees of Decision Trees</a>by D. Heath, S. Kasif, and S. Salzberg.  In B. Gorayska and J. Mey (Eds.),<I>Cognitive Technology: In Search of a Humane Interface</I>(pp. 305--317).  Amsterdam:  Elsevier Science B.V., 1996. (191K, PostScript)<li> <!WA17><a href = "http://www.cs.jhu.edu/~salzberg/limited-memory.ps"> Learning Nested Concept Classes with Limited Storage</a> by D. Heath, S. Kasif, R. Kosaraju, S. Salzberg, andG. Sullivan. (Original, much shorter version appeared in the<I>IJCAI-91</I> proceedings.  To appear (1996)in <I>Journal of Experimental and Theoretical Artificial Intelligence</I>.(228K, PostScript)<li> <!WA18><a href = "http://www.cs.jhu.edu/~salzberg/mlj91.dvi"> A Nearest Hyperrectangle Learning Method</a> by S. Salzberg.  <I>Machine Learning</I>, vol. 6 (1991), 251-276.  Figures missing. (111K, DVI format)<li> <!WA19><a href = "http://www.cs.jhu.edu/~salzberg/orthogonal.ps"> Testing Orthogonal Shapes</a> byK. Romanik and S. Salzberg.  <I>Computational Geometry: Theory and Applications</I> 5 (1995), 33--49. (234K, PostScript)<li> Sreerama K. Murthy (1995). <!WA20><a href="http://www.cs.jhu.edu/grad/murthy/thesis/latex2html/thesis.html">  On Growing Better Decision Trees from Data</a> Ph.D. thesis, in HTML format, October 1995.</ol><h2> Machine learning systems (including source code) </h2><ol> <li> <!WA21><a href = "http://www.cs.jhu.edu/~salzberg/announce-oc1.html">      OC1 decision tree system </a><li> <!WA22><a href = "ftp://condor.cs.jhu.edu/pub/pebls">      PEBLS memory-based reasoning system </a></ol><h2> Doors to Hopkins </h2><!WA23><a href="http://www.cs.jhu.edu/">  JHU Computer Science Department </a><br><!WA24><a href="http://www.cs.jhu.edu/salzberg/cs439.html">  CS 439 Computational Biology</a>, Fall 1996 course<br><!WA25><a href="http://www.cs.jhu.edu/salzberg/cs661.html">  CS 661 Machine Learning</a>, Spring 1996 course<br><!WA26><a href="http://www.cs.jhu.edu/labs/compbio/home.html">  Computational Biology at Hopkins </a><br><!WA27><a href="http://www.cs.jhu.edu/labs/ai/home.html">  Artificial Intelligence at Hopkins </a><br><!WA28><a href="http://www.gdb.org/hopkins.html">  JHU BioInformatics Web Server </a><br><!WA29><a href="http://www.jhu.edu/">  Johns Hopkins University </a><br><!WA30><a href="http://stsci.edu/top.html">  Space Telescope Science Institute </a><br><h2> Doors to Other Universities and Laboratories </h2><!WA31><a href="http://www-ls.lanl.gov/masterhgp.html">  Center for Human Genome Studies at Los Alamos</a><br><!WA32><a href="http://www.cbil.upenn.edu/">  Computational Biology and Informatics Laboratory, University of Pennsylvania</a><br><!WA33><a href="http://www.cs.cmu.edu/Web/FrontDoor.html">  CMU School of Computer Science </a><br><!WA34><a href="http://www.lcs.mit.edu/">  MIT Laboratory for Computer Science </a><br><!WA35><a href="http://www.cs.iastate.edu/~honavar/Courses/cs673/machine-learning-courses.html"> Machine learning course pages around the country </a><br><!WA36><a href="http://rigel.hbs.harvard.edu/">  Harvard Business School Technology and Operations Management Group </a><br><!WA37><a href="http://forum.swarthmore.edu/~jay/learn-game/index.html">Machinelearning in games</a><br><h2> Weather Forecasts </h2><!WA38><a href="http://www.intellicast.com">Weather for anywhere in the U.S.or the world</a>.  Great graphics plus nice weather news stories! <br><!WA39><a href="http://www.mit.edu:8001/usa.html">  Local forecast for anywhere in the U.S.</a> <br><!WA40><a href="gopher://wx.atmos.uiuc.edu/00/States/Maryland/State%20Forecast%20%28Baltimore%29">   State Forecast for Delaware, Maryland, and Eastern WV </a> <br><h2> Miscellaneous research resources </h2><P><!WA41><a href="http://www.cs.jhu.edu/~salzberg/install-guide-2.2.2.html/gs.html">Linux Installation and Getting Started</A><br><h2> Electronic Libraries and Dictionaries</h2><!WA42><a href="http://info.cern.ch/hypertext/DataSources/bySubject/Overview.html">  The WWW Virtual Library </a><br><!WA43><a href="http://lcweb.loc.gov/">  Library of Congress </a><br><!WA44><a href="http://insti.physics.sunysb.edu/~mmartin/languages/german/german.html">German Dictionary</a><br><!WA45><a href="http://insti.physics.sunysb.edu/~mmartin/languages/french/french.html">French Dictionary</a><br><h2> Government Web Sites </h2><!WA46><a href="http://stis.nsf.gov"> National Science Foundation</a> (on-line formsfor grant submission) <br><!WA47><a href="http://www.nchgr.nih.gov">  National Center for Human Genome Researchat NIH</a> <br><h3> Personal </h3>My wife <!WA48><a href="http://www.cs.jhu.edu/salzberg/claudia.html">Claudia Salzberg</a>has a home page here <br>My father<!WA49><a href="http://blue.cla.sc.edu/psyc/salzberg.htm">Herman Salzberg</a>has a home page here <br>My brother<!WA50><a href="http://compstat.wharton.upenn.edu:8001/~salzberg/homepage.html">Alan Salzberg</a> has a home page here<p><h4> This page's net surfer logsays that you are visitor number <!WA51><IMG SRC="http://www.cs.jhu.edu/cgi-bin/counter?df=salzberg&ft=7&dd=pdg&pad=N"ALIGN=absmiddle></h4><h3>Back to CS Department Home Page </h3><!WA52><a href="http://www.cs.jhu.edu/"><!WA53><img align = top src = "http://www.cs.jhu.edu/~salzberg/home-pic.gif"></a><p>

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?