A Fast Algorithm to Find All the Maximal Frequent Sequences in a Text

One of the sequential pattern mining problems is to find the maximal frequent sequences in a database with a β support. In this paper, we propose a new algorithm to find all the maximal frequent sequences in a text instead of a database. Our algorithm in comparison with the typical sequential patter...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	García-Hernández, René A., Martínez-Trinidad, José Fco, Carrasco-Ochoa, Jesús Ariel
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Applied sciences Artificial intelligence Computer science control theory systems Exact sciences and technology Fast Algorithm Frequent Sequence Pattern recognition. Digital image processing. Computational geometry Position Node Sequential Pattern Text Mining
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	486
container_issue
container_start_page	478
container_title
container_volume	3287
creator	García-Hernández, René A. Martínez-Trinidad, José Fco Carrasco-Ochoa, Jesús Ariel
description	One of the sequential pattern mining problems is to find the maximal frequent sequences in a database with a β support. In this paper, we propose a new algorithm to find all the maximal frequent sequences in a text instead of a database. Our algorithm in comparison with the typical sequential pattern mining algorithms avoids the joining, pruning and text scanning steps. Some experiments have shown that it is possible to get all the maximal frequent sequences in a few seconds for medium texts.
doi_str_mv	10.1007/978-3-540-30463-0_60
format	Book Chapter
fullrecord	<record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_16334313</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3087963_66_494</sourcerecordid><originalsourceid>FETCH-LOGICAL-c369t-97947c5cebe4eeea6065c72d499c39e99ad19673b669992fc49ab98c6018d35b3</originalsourceid><addsrcrecordid>eNo9kE9PwzAMxcNfMcG-AYdcOBaSOE3q44QYIIE4AOcozTJWKO1IggTfHm8gfLH0_J5l_xg7leJcCmEv0DYVVLUWFQhtoBLOiB02JRlI3Gpil02kkbIC0Lj3P1NQK4v7bEIuVaHVcMiOaqsEGm2P2DTnV0GlVIO1nrCrGZ_7XPisfxlTV1bvvIx83g0LUnpeVpHf-6_u3fd8nuLHZxwKf9z2EDPvBu75U_wqJ-xg6fscp3_9mD3Pr54ub6q7h-vby9ldFcBgoWtQ21CH2EYdY_RGmDpYtdCIATAi-oVEY6E1BhHVMmj0LTbBCNksoG7hmJ397l37HHy_TH4IXXbrRBembycNsQAJ5FO_vkyj4SUm147jW3ZSuA1eR6wcOKLltijdBi-F4G95GunDXFzcpAL9nHwfVn5dYsqUaCxSxhinUcMPvHh19g</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3087963_66_494</pqid></control><display><type>book_chapter</type><title>A Fast Algorithm to Find All the Maximal Frequent Sequences in a Text</title><source>Springer Books</source><creator>García-Hernández, René A. ; Martínez-Trinidad, José Fco ; Carrasco-Ochoa, Jesús Ariel</creator><contributor>Sanfeliu, Alberto ; Martínez Trinidad, José F ; Carrasco Ochoa, Jesús A ; Sanfeliu, Alberto ; Martínez Trinidad, José Francisco ; Carrasco Ochoa, Jesús Ariel</contributor><creatorcontrib>García-Hernández, René A. ; Martínez-Trinidad, José Fco ; Carrasco-Ochoa, Jesús Ariel ; Sanfeliu, Alberto ; Martínez Trinidad, José F ; Carrasco Ochoa, Jesús A ; Sanfeliu, Alberto ; Martínez Trinidad, José Francisco ; Carrasco Ochoa, Jesús Ariel</creatorcontrib><description>One of the sequential pattern mining problems is to find the maximal frequent sequences in a database with a β support. In this paper, we propose a new algorithm to find all the maximal frequent sequences in a text instead of a database. Our algorithm in comparison with the typical sequential pattern mining algorithms avoids the joining, pruning and text scanning steps. Some experiments have shown that it is possible to get all the maximal frequent sequences in a few seconds for medium texts.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540235279</identifier><identifier>ISBN: 3540235272</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540304630</identifier><identifier>EISBN: 3540304630</identifier><identifier>DOI: 10.1007/978-3-540-30463-0_60</identifier><identifier>OCLC: 57209647</identifier><identifier>LCCallNum: Q337.5</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Artificial intelligence ; Computer science; control theory; systems ; Exact sciences and technology ; Fast Algorithm ; Frequent Sequence ; Pattern recognition. Digital image processing. Computational geometry ; Position Node ; Sequential Pattern ; Text Mining</subject><ispartof>Lecture notes in computer science, 2004, Vol.3287, p.478-486</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c369t-97947c5cebe4eeea6065c72d499c39e99ad19673b669992fc49ab98c6018d35b3</citedby><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3087963-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-30463-0_60$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-30463-0_60$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16334313$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Sanfeliu, Alberto</contributor><contributor>Martínez Trinidad, José F</contributor><contributor>Carrasco Ochoa, Jesús A</contributor><contributor>Sanfeliu, Alberto</contributor><contributor>Martínez Trinidad, José Francisco</contributor><contributor>Carrasco Ochoa, Jesús Ariel</contributor><creatorcontrib>García-Hernández, René A.</creatorcontrib><creatorcontrib>Martínez-Trinidad, José Fco</creatorcontrib><creatorcontrib>Carrasco-Ochoa, Jesús Ariel</creatorcontrib><title>A Fast Algorithm to Find All the Maximal Frequent Sequences in a Text</title><title>Lecture notes in computer science</title><description>One of the sequential pattern mining problems is to find the maximal frequent sequences in a database with a β support. In this paper, we propose a new algorithm to find all the maximal frequent sequences in a text instead of a database. Our algorithm in comparison with the typical sequential pattern mining algorithms avoids the joining, pruning and text scanning steps. Some experiments have shown that it is possible to get all the maximal frequent sequences in a few seconds for medium texts.</description><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Fast Algorithm</subject><subject>Frequent Sequence</subject><subject>Pattern recognition. Digital image processing. Computational geometry</subject><subject>Position Node</subject><subject>Sequential Pattern</subject><subject>Text Mining</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540235279</isbn><isbn>3540235272</isbn><isbn>9783540304630</isbn><isbn>3540304630</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2004</creationdate><recordtype>book_chapter</recordtype><recordid>eNo9kE9PwzAMxcNfMcG-AYdcOBaSOE3q44QYIIE4AOcozTJWKO1IggTfHm8gfLH0_J5l_xg7leJcCmEv0DYVVLUWFQhtoBLOiB02JRlI3Gpil02kkbIC0Lj3P1NQK4v7bEIuVaHVcMiOaqsEGm2P2DTnV0GlVIO1nrCrGZ_7XPisfxlTV1bvvIx83g0LUnpeVpHf-6_u3fd8nuLHZxwKf9z2EDPvBu75U_wqJ-xg6fscp3_9mD3Pr54ub6q7h-vby9ldFcBgoWtQ21CH2EYdY_RGmDpYtdCIATAi-oVEY6E1BhHVMmj0LTbBCNksoG7hmJ397l37HHy_TH4IXXbrRBembycNsQAJ5FO_vkyj4SUm147jW3ZSuA1eR6wcOKLltijdBi-F4G95GunDXFzcpAL9nHwfVn5dYsqUaCxSxhinUcMPvHh19g</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>García-Hernández, René A.</creator><creator>Martínez-Trinidad, José Fco</creator><creator>Carrasco-Ochoa, Jesús Ariel</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>A Fast Algorithm to Find All the Maximal Frequent Sequences in a Text</title><author>García-Hernández, René A. ; Martínez-Trinidad, José Fco ; Carrasco-Ochoa, Jesús Ariel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c369t-97947c5cebe4eeea6065c72d499c39e99ad19673b669992fc49ab98c6018d35b3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Fast Algorithm</topic><topic>Frequent Sequence</topic><topic>Pattern recognition. Digital image processing. Computational geometry</topic><topic>Position Node</topic><topic>Sequential Pattern</topic><topic>Text Mining</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>García-Hernández, René A.</creatorcontrib><creatorcontrib>Martínez-Trinidad, José Fco</creatorcontrib><creatorcontrib>Carrasco-Ochoa, Jesús Ariel</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>García-Hernández, René A.</au><au>Martínez-Trinidad, José Fco</au><au>Carrasco-Ochoa, Jesús Ariel</au><au>Sanfeliu, Alberto</au><au>Martínez Trinidad, José F</au><au>Carrasco Ochoa, Jesús A</au><au>Sanfeliu, Alberto</au><au>Martínez Trinidad, José Francisco</au><au>Carrasco Ochoa, Jesús Ariel</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>A Fast Algorithm to Find All the Maximal Frequent Sequences in a Text</atitle><btitle>Lecture notes in computer science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2004</date><risdate>2004</risdate><volume>3287</volume><spage>478</spage><epage>486</epage><pages>478-486</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540235279</isbn><isbn>3540235272</isbn><eisbn>9783540304630</eisbn><eisbn>3540304630</eisbn><abstract>One of the sequential pattern mining problems is to find the maximal frequent sequences in a database with a β support. In this paper, we propose a new algorithm to find all the maximal frequent sequences in a text instead of a database. Our algorithm in comparison with the typical sequential pattern mining algorithms avoids the joining, pruning and text scanning steps. Some experiments have shown that it is possible to get all the maximal frequent sequences in a few seconds for medium texts.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/978-3-540-30463-0_60</doi><oclcid>57209647</oclcid><tpages>9</tpages><oa>free_for_read</oa></addata></record>
fulltext	fulltext
identifier	ISSN: 0302-9743
ispartof	Lecture notes in computer science, 2004, Vol.3287, p.478-486
issn	0302-9743 1611-3349
language	eng
recordid	cdi_pascalfrancis_primary_16334313
source	Springer Books
subjects	Applied sciences Artificial intelligence Computer science control theory systems Exact sciences and technology Fast Algorithm Frequent Sequence Pattern recognition. Digital image processing. Computational geometry Position Node Sequential Pattern Text Mining
title	A Fast Algorithm to Find All the Maximal Frequent Sequences in a Text
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T01%3A00%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=A%20Fast%20Algorithm%20to%20Find%20All%20the%20Maximal%20Frequent%20Sequences%20in%20a%20Text&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Garc%C3%ADa-Hern%C3%A1ndez,%20Ren%C3%A9%20A.&rft.date=2004&rft.volume=3287&rft.spage=478&rft.epage=486&rft.pages=478-486&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540235279&rft.isbn_list=3540235272&rft_id=info:doi/10.1007/978-3-540-30463-0_60&rft_dat=%3Cproquest_pasca%3EEBC3087963_66_494%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540304630&rft.eisbn_list=3540304630&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3087963_66_494&rft_id=info:pmid/&rfr_iscdi=true