Finding maximal sequential patterns in text document collections and single documents

dc.creatorRENE ARNULFO GARCIA HERNANDEZ
dc.creatorJOSE FRANCISCO MARTINEZ TRINIDAD
dc.creatorJESUS ARIEL CARRASCO OCHOA
dc.date2010
dc.date.accessioned2023-07-25T16:23:35Z
dc.date.available2023-07-25T16:23:35Z
dc.identifierhttp://inaoe.repositorioinstitucional.mx/jspui/handle/1009/1403
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7806599
dc.descriptionIn this paper, two algorithms for discovering all the Maximal Sequential Patterns (MSP) in a document collection and in a single document are presented. The proposed algorithms follow the “pattern-growth strategy” where small frequent sequences are found first with the goal of growing them to obtain MSP. Our algorithms process the documents in an incremental way avoiding re-computing all the MSP when new documents are added. Experiments showing the performance of our algorithms and comparing against GSP, DELISP, GenPrefixSpan and cSPADE algorithms over public standard databases are also presented.
dc.formatapplication/pdf
dc.languageeng
dc.publisherInformatica
dc.relationcitation:García-Hernández, R.A., et al., (2010). Finding maximal sequential patterns in text document collections and single, Informatica, (34): 93–101
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/4.0
dc.subjectinfo:eu-repo/classification/Text mining/Text mining
dc.subjectinfo:eu-repo/classification/Maximal sequential patterns/Maximal sequential patterns
dc.subjectinfo:eu-repo/classification/cti/1
dc.subjectinfo:eu-repo/classification/cti/12
dc.subjectinfo:eu-repo/classification/cti/1203
dc.subjectinfo:eu-repo/classification/cti/1203
dc.titleFinding maximal sequential patterns in text document collections and single documents
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/acceptedVersion
dc.audiencestudents
dc.audienceresearchers
dc.audiencegeneralPublic


Este ítem pertenece a la siguiente institución