📄 http:^^www.vuse.vanderbilt.edu^~dfisher^tech-reports.html
字号:
Date: Tue, 26 Nov 1996 00:59:49 GMT
Server: Apache/1.1.1
Content-type: text/html
Content-length: 19291
Last-modified: Mon, 29 Apr 1996 12:57:59 GMT
<TITLE> D. H. Fisher Research Group </TITLE><body bgcolor="#ffffff"> <h2> <!WA0><A HREF="http://www.vuse.vanderbilt.edu/~dfisher/dfisher.html"> Doug Fisher's </a> research group list </h2> <DL> <DD> <!WA1><A HREF="http://www.vuse.vanderbilt.edu/~csinfo/cs.html"> Department of Computer Science </A> <DD> Box 1679, Station B <DD> <!WA2><a href="http://www.vanderbilt.edu">Vanderbilt University</A> <DD> <!WA3><a href="http://www.nashville.net">Nashville</A>, Tennessee 37235 <DD> USA </DL><DL><DT> Phone: (615) 343-4111<DT> FAX: (615) 343-8006<DT> Email: dfisher@vuse.vanderbilt.edu</DL><hr>A full list of publications can be found at the latter portionof this page.Gradually, abstracts of these publicationswill be placed on line in htmlform, with pointers to subsequent work, raw data, reader comments,and other material appropriate for an addendum. A list of current online reports or addenda are given first.<hr><h2> Online Reports and Addenda </h2>In many cases, technical reports and electronic addenda of published workwill be placed on line here in both postscriptand html format (though not necessarily at the same time).Your comments are welcome. In certain of these cases,should you email comments regarding related literature, suggestions for experimental or theoretical improvements, alternative viewpoints, then your comments, if reasonableand informative, they will be linked to the html version of the technical report (or addendum) and under a separate list of comments -- unlessyou state that you do not want this to be done. I may alsolink responses to your comments, but not before getting your feedbackon a response. <p>Comments on purely style issues are welcome, but they probably will not be linked in. Others who view the technical report will be free to view your comments as well. If your comments inform a revision of the report (e.g., for publication), then I will acknowledge them as a personal communication, or otherwise cite the literature that you relate (if I deem it relevant). If your comments are online and linked to a report, then you agree to allow others to cite them as personal communication as well (again, unless you statethat your comments should not be linked).<p>The following is a list of technical report titles, addenda, etc.that are currentlyonline. These are links to either postscript versions of the paper,or html `headers' that allow accessto postscript and html versions.<p><h2> Online Research Titles: </h2><p>Fisher, D. (1992). <!WA4><A HREF="http://www.vuse.vanderbilt.edu/~dfisher/tech-reports/tr-92-12.html">Pessimistic and Optimistic Induction (TR CS-92-12)</A>.<p>Fisher, D. (1995). Iterative Optimization and Simplification ofHierarchical Clusterings (TR CS-95-01). Superceded by<!WA5><AHREF="http://cswww.vuse.vanderbilt.edu/~dfisher/jair-96/html-final/html-final.html">JAIR paper</A> of same name.<p>Fisher (1995). <!WA6><A HREF="http://www.vuse.vanderbilt.edu/~dfisher/tech-reports/TSE-95.html">An addendum to `Machine Learning Approaches to Estimating SoftwareDevelopment Effort' (IEEE TSE, 1995) </A><p>Fisher, D. (in preparation).A Survey of Supervised, Machine Learning Systems(coming soon).<p>Ortega, J. (1995). <!WA7><AHREF="http://www.vuse.vanderbilt.edu/~julio/tn.ps">On the informativeness of the DNA promoter sequences domaintheory.</a> Journal of Artificial Intelligence Research.<p>Fisher, D. (1996). <!WA8><A HREF="http://cswww.vuse.vanderbilt.edu/~dfisher/jair-96/html-final/html-final.html">Iterative Optimization and Simplification ofHierarchical Clusterings</A>.<i>Journal of Artificial Intelligence Research, 4</i>, pp. 147-180.<p>Lin, J. (1995). <i><!WA9><a href="http://cswww.vuse.vanderbilt.edu/~dfisher/linj/Thesis/root/root.html">A comparative study of default strategiesfor a decision list learner</a></i>. Masters Thesis. Departmentof Computer Science, Vanderbilt University, Nashville, TN. <p> Manganaris, S. (1996). <!WA10><A HREF="http://www.vuse.vanderbilt.edu/~dfisher/tech-reports/abdea.html"> "A Bayesian Density Estimation Algorithm." (abstract, html)</A> Submitted to KDD '96 and ISIS.<BR> PostScript (182K) <!WA11><A HREF="http://www.vuse.vanderbilt.edu/~dfisher/tech-reports/abdea.ps">abdea.ps</A>.<p> Manganaris, S. (1995). <!WA12><A HREF="http://www.vuse.vanderbilt.edu/~dfisher/tech-reports/ltcsd.html"> "Learning to Classify Sensor Data."</A> IJCAI '95, Workshop on Machine Learning in Engineering.<BR> PostScript (209K) <!WA13><A HREF="http://www.vuse.vanderbilt.edu/~dfisher/tech-reports/ltcsd.ps">ltcsd.ps</A>.<p> Manganaris, S. (1995). <!WA14><A HREF="http://www.vuse.vanderbilt.edu/~dfisher/tech-reports/biofitd.html"> "Bayesian Induction of Features in Temporal Domains." (abstract, html)</A> IJCAI '95, Workshop on Data Engineering for Inductive Learning.<BR> PostScript (210K) <!WA15><A HREF="http://www.vuse.vanderbilt.edu/~dfisher/tech-reports/biofitd.ps">biofitd.ps</A>.<p> Manganaris, S. & Fisher, D. (1994). <!WA16><A HREF="http://www.vuse.vanderbilt.edu/~dfisher/tech-reports/ltsfim.html"> "Learning Time Series for Intelligent Monitoring."</A> In <cite>Proc. of the Third Intl. Symposium on Artificial Intelligence, Robotics, and Automation for Space,</cite> pages 71-74, Pasadena, CA, October 1994.<hr><hr><p><h2> Other Research Titles: </h2>In some cases, abstracts or other auxiliary material is onlinefor these titles. <p><b> Archival Periodicals </b><p>Evans, B., & Fisher, D. (1994). <!WA17><A HREF="http://www.vuse.vanderbilt.edu/~dfisher/tech-reports/IEEE-Exp-94.html">``Process delay analysis using decision treeinduction.''</a> <i> IEEE Expert, 9, 1</i>, 60-66.<p>Fisher, D. (1987) ``Knowledge Acquisition Via Incremental Conceptual Clustering,'' <i> Machine Learning, 2</i>, 139-172.Reprinted in <i> Readings in Machine Learning</i>, J. Shavlik &T. Dietterich (Eds.), 267-283, Morgan Kaufmann, 1990.<p>Fisher, D. (1996). <!WA18><A HREF="http://cswww.vuse.vanderbilt.edu/~dfisher/tech-reports/jair96.html">Iterative Optimization and Simplification ofHierarchical Clusterings</A>.<i>Journal of Artificial Intelligence Research, 4</i>, pp. 147-180.<p>Fisher, D., & Chan, P. (1990). ``Statistical Guidance in Symbolic Learning,'' <i> Annals of Mathematics and Artificial Intelligence, 2</i>, 135-148.<p>Fisher, D., & Hapanyengwi, G. (1993). ``Database Management and Analysis Tools of Machine Learning.'' <i> Journal of IntelligentInformation Systems, 2</i>, 5-38.<p>Fisher, D., & Langley, P. (1990). ``The Structure and Formation of NaturalCategories," In Gordon Bower (Ed.), <i> The Psychology of Learning and Motivation</i>, <i> Vol. 26</i>, San Diego, CA: Academic Press, 241-284.<p>Fisher, D., & Yoo, J. (1993).<!WA19><a href="http://www.vuse.vanderbilt.edu/~dfisher/problem-solve.html">``Problem solving, categorization, and conceptlearning: A unifying view''</a> In Nakamura, G., Taraban, R., & Medin, D.(Eds.) <i> The Psychology of Learning and Motivation</i>, <i> Vol. 29</i>, SanDiego, CA: Academic Press, 219-255.<p>Fisher, D., Xu, L., Carnes, R., Reich, Y., Fenves, S., Chen, J.,Shiavi, R., Biswas, G., & Weinberg, J. (1993). ``ApplyingAI clustering to engineering tasks.'' <i> IEEE Expert, 8, 6</i>,51-60.<p>Gennari, J., Langley, P., & Fisher, D. (1989).``Models of Incremental Concept Formation'', <i> Artificial Intelligence, 40</i>, 11-62.<p>Ortega, J. (1995). <!WA20><AHREF="http://www.vuse.vanderbilt.edu/~julio/tn.ps">On the informativeness of the DNA promoter sequences domaintheory.</a> Journal of Artificial Intelligence Research.<p>Saraf, R., & Fisher, D. (in press) <!WA21><a href="http://www.vuse.vanderbilt.edu/~dfisher/traffic.html">``Online signal-plan generationfor centralized traffic control using neural networks.''</a> <i> IVHS Journal</i>.<p>Srinivasan, K., & Fisher, D. (1995). iii) <!WA22><A HREF="http://www.vuse.vanderbilt.edu/~dfisher/tech-reports/TSE-95.html">``Machine learning approaches toestimating software development effort.''</a> <i> IEEE Transactions on SoftwareEngineering, 21</i>, 126-137.<hr><b> Books and Chapters therein</b><p>Fisher, D., & Lenz, H.J., Eds. (1996). <i> Learning from Data: Artificial and Intelligence V.</i> New York, NY: Springer Verlag,450 pages, 42 chapters.<p>Fisher, D., Pazzani, M., & Langley, P., Eds., (1991).<i> Concept Formation: Experienceand Knowledge in Unsupervised Learning</i>. San Mateo, CA:Morgan Kaufmann, 472 pages, 15 chapters.<p>Fisher, D., & Pazzani, M. (1991). ``Computational Models of Concept Induction''In Fisher, D., Pazzani, M., & Langley, P. (Eds.)<i> Concept Formation: Experienceand Knowledge in Unsupervised Learning</i>. San Mateo, CA:Morgan Kaufmann, 3-44.<p>Fisher, D., & Pazzani, M. (1991).``Theory-Guided Concept Formation''In Fisher, D., Pazzani, M., & Langley, P. (Eds.) <i> Concept Formation: Experienceand Knowledge in Unsupervised Learning</i>. San Mateo, CA:Morgan Kaufmann, 165-178.<p>Fisher, D., & Pazzani, M. (1991).``Concept Formation in Context'' In Fisher, D., Pazzani, M., & Langley, P.(Eds.) <i> Concept Formation: Experienceand Knowledge in Unsupervised Learning</i>. San Mateo, CA:Morgan Kaufmann, 307-322.<p>Yoo, J., & Fisher, D. (1991).``Concept Formation over Problem-Solving Experience''In Fisher, D., Pazzani, M., & Langley, P.(Eds.) <i> Concept Formation: Experienceand Knowledge in Unsupervised Learning</i>. San Mateo, CA:Morgan Kaufmann, 279-306.<hr><b> Other Book Chapters</b><p>Biswas, G., Goldman, S., Fisher, D., Bhuva, B., & Glewwe, G. (1995).``Assessing Design Activity in Complex CMOS Circuit Design'' InP. Nichols, S. Chipman, & B. Brennan (Eds.), <i> CognitivelyDiagnostic Assessment</i>, Lawrence Erlbaum, pp. 167-188.<p>Evans, R., & Fisher, D. (in press). ``Mitigating Delays in Printing with InteractiveMachine Induction'' In P. Langley& Y. Kodratoff (Eds.), <i> Fielded Applications of MachineLearning</i>, Morgan Kaufmann.<p>Fisher, D., & Langley, P. (1986).``Methods of conceptual clustering and their relation to numerical taxonomy,'' In W. Gale (Ed.), <i> Artificial Intelligence and Statistics</i>.Addison-Wesley, 77-116.⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -