dc.contributorRENE ARMANDO CUMPLIDO PARRA
dc.contributorLUIS VILLASEÑOR PINEDA
dc.creatorOSVALDO NAVARRO GUZMAN
dc.date2012
dc.date.accessioned2018-11-19T14:29:01Z
dc.date.available2018-11-19T14:29:01Z
dc.identifierhttp://inaoe.repositorioinstitucional.mx/jspui/handle/1009/764
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/2258906
dc.descriptionSequential Pattern Mining is a widely addressed problem in data mining, with applications such as analyzing Web usage, automatic text reuse detection, analyzing purchase behavior, among others. Nevertheless, with the dramatic increase in data volume, the current approaches result inefficient when dealing with large input datasets, a large number of different symbols and low minimum supports. We propose a new sequential pattern mining algorithm, which follows a pattern growth scheme to discover frequent patterns, that is, by recursively growing an already known frequent pattern p using frequent symbols from the projected database with respect to p. Our algorithm only maintains in memory a structure of the pseudo-projections and the symbols required for the algorithm in case it has to go back and try to grow a pattern with another valid element. Also, we propose a hardware architecture that implements the processes of generating pseudo-projection databases and finding frequent elements from a projection database, which comprehends the most costly operations of our algorithm, in order to accelerate its running time. Experimental results showed that our algorithm has a better performance and scalability, in comparison with the UDDAG and PLWAP algorithms. Moreover, a performance estimate showed us that our hardware architecture significantly reduces the running time of our proposed algorithm. To our knowledge, this is the first hardware architecture that tackles the problem of sequential pattern mining.
dc.formatapplication/pdf
dc.languageeng
dc.publisherInstituto Nacional de Astrofísica, Óptica y Electrónica
dc.relationcitation:Navarro-Guzman O.
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/4.0
dc.subjectinfo:eu-repo/classification/Secuencias/Sequences
dc.subjectinfo:eu-repo/classification/Minería de datos/Data mining
dc.subjectinfo:eu-repo/classification/Reconocimiento de patrones/Pattern recognition
dc.subjectinfo:eu-repo/classification/Códigos de hardware y software/Hardware-software codesign
dc.subjectinfo:eu-repo/classification/cti/1
dc.subjectinfo:eu-repo/classification/cti/12
dc.subjectinfo:eu-repo/classification/cti/1203
dc.titleAlgorithm and hardware architecture for the discovery of frequent sequences
dc.typeTesis
dc.typeinfo:eu-repo/semantics/acceptedVersion
dc.audiencestudents
dc.audienceresearchers
dc.audiencegeneralPublic


Este ítem pertenece a la siguiente institución