%0 Report %1 zhang2004a %A Zhang, Jian %A Yang, Yiming %A Carbonell, Jaime %D 2004 %K detection event kernel knn svm %N CMU-CS-04-118 %T New Event Detection with nearest Neighbor, Support Vector Machines, and Kernel Regression %U http://reports-archive.adm.cs.cmu.edu/anon/2004/abstracts/04-118.html %X This document also appears as Language Technologies InstituteKeywords: Artificial Intelligence: Learning, Pattern Recognition: Models-Statistical; Pattern Recognition: Design Methodology-Classifier design and evaluation; algorithms, novelty detection, new event detection, nearest neighbor, support, vector machines, kernel regression Support Vector Machines have received extensive attention in machine learning community and have been successfully applied in pattern recognition and regression problems. Recently, it has also been proposed to solve novelty detection problems, whose objective is to detect novel objects from existing instances.which can be treated as one special application of novelty detection, has been a research topic in Topic Detection and Tracking(TDT)community for several years. However, the winning technology of NED in the TDT community has remained to be the nearest neighbor method with suitable distance metric in the document vector space. In this paper we investigated Support Vector Machines and kernel regression(as a smoothed nearest neighbor method)for the NED task, and compared them to the nearest neighbor method. We conducted a set of experiments on TDT benchmark collections, and provided analysis on the failure of SVM for not being able to capture misses

@techreport{zhang2004a, abstract = {This document also appears as Language Technologies InstituteKeywords: Artificial Intelligence: Learning, Pattern Recognition: Models-Statistical; Pattern Recognition: Design Methodology-Classifier design and evaluation; algorithms, novelty detection, new event detection, nearest neighbor, support, vector machines, kernel regression Support Vector Machines have received extensive attention in machine learning community and have been successfully applied in pattern recognition and regression problems. Recently, it has also been proposed to solve novelty detection problems, whose objective is to detect novel objects from existing instances.which can be treated as one special application of novelty detection, has been a research topic in Topic Detection and Tracking(TDT)community for several years. However, the winning technology of NED in the TDT community has remained to be the nearest neighbor method with suitable distance metric in the document vector space. In this paper we investigated Support Vector Machines and kernel regression(as a smoothed nearest neighbor method)for the NED task, and compared them to the nearest neighbor method. We conducted a set of experiments on TDT benchmark collections, and provided analysis on the failure of SVM for not being able to capture misses}, added-at = {2010-01-31T21:50:48.000+0100}, author = {Zhang, Jian and Yang, Yiming and Carbonell, Jaime}, biburl = {https://www.bibsonomy.org/bibtex/20941cafe48a5a63790b2974233079e2b/jgomezdans}, description = {COMPUTER SCIENCE TECHNICAL REPORT ABSTRACTS}, institution = {CMU}, interhash = {cfb07a4bcbdd7e10b0f9a23a26f5d127}, intrahash = {0941cafe48a5a63790b2974233079e2b}, keywords = {detection event kernel knn svm}, month = {April}, number = {CMU-CS-04-118}, tech = {Technical Report CMU-LTI-04-180 CMU-CS-04-118. ps CMU-CS-04-118.36 pages}, timestamp = {2010-01-31T21:50:49.000+0100}, title = {New Event Detection with nearest Neighbor, Support Vector Machines, and Kernel Regression }, url = {http://reports-archive.adm.cs.cmu.edu/anon/2004/abstracts/04-118.html}, year = 2004 }