Publications

Detailed Information

A hybrid novelty score and its use in keystroke dynamics-based user authentication

DC Field Value Language
dc.contributor.authorKang, Pilsung-
dc.contributor.authorCho, Sungzoon-
dc.date.accessioned2012-03-05T02:31:56Z-
dc.date.available2012-03-05T02:31:56Z-
dc.date.issued2009-11-01-
dc.identifier.citationPATTERN RECOGNITION; Vol.42 11; 3115-3127-
dc.identifier.issn0031-3203-
dc.identifier.urihttps://hdl.handle.net/10371/75357-
dc.description.abstractThe purpose of novelty detection is to detect (novel) patterns that are not generated by the identical distribution of the normal class. A distance-based novelty detector classifies a new data pattern as "novel" if its distance from "normal" patterns is large. It is intuitive, easy to implement, and fits naturally With incremental learning. Its performance is limited, however, because it relies only on distance. In this paper, we propose considering topological relations as well. We compare our proposed method with 13 other novelty detectors based on 21 benchmark data sets from two sources. We then apply our method to a real-world application in which incremental learning is necessary: keystroke dynamics-based user authentication. The experimental results are promising. Not only does our method improve the performance of distance-based novelty detectors, but it also outperforms the other non-distance-based algorithms. Our method also allows efficient model updates. (C) 2009 Elsevier Ltd. All rights reserved.-
dc.language.isoen-
dc.publisherELSEVIER SCI LTD-
dc.subjectNovelty detection-
dc.subjectIncremental learning-
dc.subjectKeystroke dynamics-based user authentication-
dc.subjectNearest-neighbor learning-
dc.subjectTopological relation-
dc.titleA hybrid novelty score and its use in keystroke dynamics-based user authentication-
dc.typeArticle-
dc.contributor.AlternativeAuthor강필성-
dc.contributor.AlternativeAuthor조성준-
dc.identifier.doi10.1016/j.patcog.2009.04.009-
dc.citation.journaltitlePATTERN RECOGNITION-
dc.description.citedreferenceJuszczak P, 2009, NEUROCOMPUTING, V72, P1859, DOI 10.1016/j.neucom.2008.05.003-
dc.description.citedreferenceKang P, 2008, PATTERN RECOGN, V41, P3507, DOI 10.1016/j.patcog.2008.04.009-
dc.description.citedreferenceKang P, 2008, COMPUT SECUR, V27, P3, DOI 10.1016/j.cose.2008.02.001-
dc.description.citedreferenceLee HJ, 2008, ARTIF INTELL MED, V42, P199, DOI 10.1016/j.artmed.2007.11.001-
dc.description.citedreferenceLee HJ, 2007, COMPUT SECUR, V26, P300, DOI 10.1016/j.cose.2006.11.006-
dc.description.citedreferenceHarmeling S, 2006, NEUROCOMPUTING, V69, P1608, DOI 10.1016/j.neucom.2005.05.015-
dc.description.citedreferenceCherry GA, 2006, IEEE T SEMICONDUCT M, V19, P159, DOI 10.1109/TSM.2006.873524-
dc.description.citedreferenceNanni L, 2006, NEUROCOMPUTING, V69, P869, DOI 10.1016/j.neucom.2005.06.007-
dc.description.citedreferenceYu EZ, 2006, EXPERT SYST APPL, V30, P352, DOI 10.1016/j.eswa.2005.07.026-
dc.description.citedreferenceBOUTSINAS B, 2006, PATTERN RECOGN, V16, P143, DOI 10.1134/S1054661806020015-
dc.description.citedreferenceClarke NL, 2005, COMPUT SECUR, V24, P519, DOI 10.1016/j.cose.2005.08.003-
dc.description.citedreferenceBarreto GA, 2005, IEEE T NEURAL NETWOR, V16, P1064, DOI 10.1109/TNN.2005.853416-
dc.description.citedreferenceAraujo LCF, 2005, IEEE T SIGNAL PROCES, V53, P851, DOI 10.1109/TSP.2004.839903-
dc.description.citedreferenceAngiulli F, 2005, IEEE T KNOWL DATA EN, V17, P203, DOI 10.1109/TKDE.2005.31-
dc.description.citedreferenceSARMIENTO T, 2005, P 2005 IEEE SEMI ADV, P139-
dc.description.citedreferenceFURNELL S, 2005, COMPUT FRAUD SEC AUG, P9-
dc.description.citedreferenceYan J, 2004, IEEE SECUR PRIV, V2, P25, DOI 10.1109/MSP.2004.81-
dc.description.citedreferencePeacock A, 2004, IEEE SECUR PRIV, V2, P40, DOI 10.1109/MSP.2004.89-
dc.description.citedreferencePRABHAKAR S, 2003, IEEE SECUR PRIV, V1, P33, DOI 10.1109/MSECP.2003.1193209-
dc.description.citedreferenceJOLLIFFE I, 2003, PRINCIPLE COMPONENT-
dc.description.citedreferenceYegnanarayana B, 2002, NEURAL NETWORKS, V15, P459, DOI 10.1016/S0893-6080(02)00019-9-
dc.description.citedreferenceMONROSE F, 2002, INT J INFORMATION SE, V1, P69, DOI 10.1007/s102070100006-
dc.description.citedreferenceScholkopf B, 2001, NEURAL COMPUT, V13, P1443-
dc.description.citedreferenceRatsch G, 2001, MACH LEARN, V42, P287-
dc.description.citedreferenceTAX D, 2001, THESIS DELFT U TECHN-
dc.description.citedreferencePizzi NJ, 2001, ARTIF INTELL MED, V21, P263-
dc.description.citedreferenceGuha S, 2000, INFORM SYST, V25, P345-
dc.description.citedreferenceKnorr EM, 2000, VLDB J, V8, P237-
dc.description.citedreferenceMonrose F, 2000, FUTURE GENER COMP SY, V16, P351-
dc.description.citedreferenceMCLACHLAN G, 2000, FINITE MIXTURE MODEL-
dc.description.citedreferenceDUDA RO, 2000, PATTERN CLASSIFICATI-
dc.description.citedreferenceRAMASWAMY S, 2000, P INT C MAN DAT SIGM-
dc.description.citedreferenceKARYPIS G, 1999, IEEE COMPUT, V32, P68, DOI DOI 10.1109/2.781637-
dc.description.citedreferenceJAIN AK, 1999, BIOMETRICS PERSONAL-
dc.description.citedreferenceScholkopf B, 1998, NEURAL COMPUT, V10, P1299-
dc.description.citedreferenceGUHA S, 1998, P ACM SIGMOD INT C M, P73-
dc.description.citedreferencePLATT JC, 1998, ADV KERNEL METHODS S, P41-
dc.description.citedreferenceYPMA A, 1998, P INT C ART NEUR NET-
dc.description.citedreferenceOSUNA E, 1997, P 1997 IEEE WORKSH N, P276-
dc.description.citedreferenceBURGE P, 1997, P AI APPR FRAUD DET, P9-
dc.description.citedreferencePOLEMI D, 1997, BIOMETRIC TECHNIQUES-
dc.description.citedreferenceZHANG T, 1996, P 1996 ACM SIGMOD IN, P103, DOI DOI 10.1145/235968.233324-
dc.description.citedreferenceBISHOP CM, 1995, NEURAL NETWORK PATTE-
dc.description.citedreferenceBARNETT V, 1994, OUTLIERS STAT DATA-
dc.description.citedreferenceVAPNIK VN, 1982, ESTIMATION DEPENDENC-
dc.description.citedreferenceHAWKINS DM, 1980, IDENTIFICATION OUTLI-
dc.description.tc0-
dc.identifier.wosid000268453800064-
Appears in Collections:
Files in This Item:
There are no files associated with this item.

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share