Loading…
MCoR-Miner: Maximal Co-Occurrence Nonoverlapping Sequential Rule Mining
The aim of sequential pattern mining (SPM) is to discover potentially useful information from a given sequence. Although various SPM methods have been investigated, most of these focus on mining all of the patterns. However, users sometimes want to mine patterns with the same specific prefix pattern...
Saved in:
Published in: | IEEE transactions on knowledge and data engineering 2023-09, Vol.35 (9), p.1-16 |
---|---|
Main Authors: | , , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c294t-fb28ae6a4319670021f2e019e64e2a23f805e608e51d03da5850a4b695bc43b53 |
---|---|
cites | cdi_FETCH-LOGICAL-c294t-fb28ae6a4319670021f2e019e64e2a23f805e608e51d03da5850a4b695bc43b53 |
container_end_page | 16 |
container_issue | 9 |
container_start_page | 1 |
container_title | IEEE transactions on knowledge and data engineering |
container_volume | 35 |
creator | Li, Yan Zhang, Chang Li, Jie Song, Wei Qi, Zhenlian Wu, Youxi Wu, Xindong |
description | The aim of sequential pattern mining (SPM) is to discover potentially useful information from a given sequence. Although various SPM methods have been investigated, most of these focus on mining all of the patterns. However, users sometimes want to mine patterns with the same specific prefix pattern, called co-occurrence pattern. Since sequential rule mining can make better use of the results of SPM, and obtain better recommendation performance, this paper addresses the issue of maximal co-occurrence nonoverlapping sequential rule (MCoR) mining and proposes the MCoR-Miner algorithm. To improve the efficiency of support calculation, MCoR-Miner employs depth-first search and backtracking strategies equipped with an indexing mechanism to avoid the use of sequential searching. To obviate useless support calculations for some sequences, MCoR-Miner adopts a filtering strategy to prune the sequences without the prefix pattern. To reduce the number of candidate patterns, MCoR-Miner applies the frequent item and binomial enumeration tree strategies. To avoid searching for the maximal rules through brute force, MCoR-Miner uses a screening strategy. To validate the performance of MCoR-Miner, eleven competitive algorithms were conducted on eight sequences. Our experimental results showed that MCoR-Miner outperformed other competitive algorithms, and yielded better recommendation performance than frequent co-occurrence pattern mining. All algorithms and datasets can be downloaded from https://github.com/wuc567/Pattern-Mining/tree/master/MCoR-Miner . |
doi_str_mv | 10.1109/TKDE.2023.3241213 |
format | article |
fullrecord | <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_10032631</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>10032631</ieee_id><sourcerecordid>2847965567</sourcerecordid><originalsourceid>FETCH-LOGICAL-c294t-fb28ae6a4319670021f2e019e64e2a23f805e608e51d03da5850a4b695bc43b53</originalsourceid><addsrcrecordid>eNpNkE1Lw0AQhhdRsFZ_gOAh4Dl1Zr-y8SaxVrG1UOt52aQTSYlJ3DSi_94t9eBph-V55-Nh7BJhggjpzfr5fjrhwMVEcIkcxREboVIm5pjicahBYiyFTE7ZWd9vAcAkBkdstsjaVbyoGvK30cJ9Vx-ujrI2XhbF4D01BUUvbdN-ka9d11XNe_RKnwM1uypwq6GmKGTD9zk7KV3d08XfO2ZvD9N19hjPl7On7G4eFzyVu7jMuXGknRSY6gSAY8kJMCUtiTsuSgOKNBhSuAGxccoocDLXqcoLKXIlxuz60Lfzbdij39ltO_gmjLTcyCTVSukkUHigCt_2vafSdj5c5n8sgt37sntfdu_L_vkKmatDpiKifzwIrgWKXw4NZO4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2847965567</pqid></control><display><type>article</type><title>MCoR-Miner: Maximal Co-Occurrence Nonoverlapping Sequential Rule Mining</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Li, Yan ; Zhang, Chang ; Li, Jie ; Song, Wei ; Qi, Zhenlian ; Wu, Youxi ; Wu, Xindong</creator><creatorcontrib>Li, Yan ; Zhang, Chang ; Li, Jie ; Song, Wei ; Qi, Zhenlian ; Wu, Youxi ; Wu, Xindong</creatorcontrib><description>The aim of sequential pattern mining (SPM) is to discover potentially useful information from a given sequence. Although various SPM methods have been investigated, most of these focus on mining all of the patterns. However, users sometimes want to mine patterns with the same specific prefix pattern, called co-occurrence pattern. Since sequential rule mining can make better use of the results of SPM, and obtain better recommendation performance, this paper addresses the issue of maximal co-occurrence nonoverlapping sequential rule (MCoR) mining and proposes the MCoR-Miner algorithm. To improve the efficiency of support calculation, MCoR-Miner employs depth-first search and backtracking strategies equipped with an indexing mechanism to avoid the use of sequential searching. To obviate useless support calculations for some sequences, MCoR-Miner adopts a filtering strategy to prune the sequences without the prefix pattern. To reduce the number of candidate patterns, MCoR-Miner applies the frequent item and binomial enumeration tree strategies. To avoid searching for the maximal rules through brute force, MCoR-Miner uses a screening strategy. To validate the performance of MCoR-Miner, eleven competitive algorithms were conducted on eight sequences. Our experimental results showed that MCoR-Miner outperformed other competitive algorithms, and yielded better recommendation performance than frequent co-occurrence pattern mining. All algorithms and datasets can be downloaded from https://github.com/wuc567/Pattern-Mining/tree/master/MCoR-Miner .</description><identifier>ISSN: 1041-4347</identifier><identifier>EISSN: 1558-2191</identifier><identifier>DOI: 10.1109/TKDE.2023.3241213</identifier><identifier>CODEN: ITKEEH</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Business competition ; co-occurrence pattern ; Data mining ; Enumeration ; Itemsets ; Mathematical analysis ; maximal rule mining ; Mining ; Pattern analysis ; Pattern matching ; Prediction algorithms ; Protein sequence ; rule-antecedent ; Searching ; Sequences ; Sequential pattern mining ; sequential rule mining ; Spatial databases ; Strategy ; Time series analysis</subject><ispartof>IEEE transactions on knowledge and data engineering, 2023-09, Vol.35 (9), p.1-16</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c294t-fb28ae6a4319670021f2e019e64e2a23f805e608e51d03da5850a4b695bc43b53</citedby><cites>FETCH-LOGICAL-c294t-fb28ae6a4319670021f2e019e64e2a23f805e608e51d03da5850a4b695bc43b53</cites><orcidid>0000-0001-5314-3468 ; 0000-0002-2053-4662 ; 0000-0003-0649-8850 ; 0000-0002-1126-9772 ; 0000-0003-2396-1704</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/10032631$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Li, Yan</creatorcontrib><creatorcontrib>Zhang, Chang</creatorcontrib><creatorcontrib>Li, Jie</creatorcontrib><creatorcontrib>Song, Wei</creatorcontrib><creatorcontrib>Qi, Zhenlian</creatorcontrib><creatorcontrib>Wu, Youxi</creatorcontrib><creatorcontrib>Wu, Xindong</creatorcontrib><title>MCoR-Miner: Maximal Co-Occurrence Nonoverlapping Sequential Rule Mining</title><title>IEEE transactions on knowledge and data engineering</title><addtitle>TKDE</addtitle><description>The aim of sequential pattern mining (SPM) is to discover potentially useful information from a given sequence. Although various SPM methods have been investigated, most of these focus on mining all of the patterns. However, users sometimes want to mine patterns with the same specific prefix pattern, called co-occurrence pattern. Since sequential rule mining can make better use of the results of SPM, and obtain better recommendation performance, this paper addresses the issue of maximal co-occurrence nonoverlapping sequential rule (MCoR) mining and proposes the MCoR-Miner algorithm. To improve the efficiency of support calculation, MCoR-Miner employs depth-first search and backtracking strategies equipped with an indexing mechanism to avoid the use of sequential searching. To obviate useless support calculations for some sequences, MCoR-Miner adopts a filtering strategy to prune the sequences without the prefix pattern. To reduce the number of candidate patterns, MCoR-Miner applies the frequent item and binomial enumeration tree strategies. To avoid searching for the maximal rules through brute force, MCoR-Miner uses a screening strategy. To validate the performance of MCoR-Miner, eleven competitive algorithms were conducted on eight sequences. Our experimental results showed that MCoR-Miner outperformed other competitive algorithms, and yielded better recommendation performance than frequent co-occurrence pattern mining. All algorithms and datasets can be downloaded from https://github.com/wuc567/Pattern-Mining/tree/master/MCoR-Miner .</description><subject>Algorithms</subject><subject>Business competition</subject><subject>co-occurrence pattern</subject><subject>Data mining</subject><subject>Enumeration</subject><subject>Itemsets</subject><subject>Mathematical analysis</subject><subject>maximal rule mining</subject><subject>Mining</subject><subject>Pattern analysis</subject><subject>Pattern matching</subject><subject>Prediction algorithms</subject><subject>Protein sequence</subject><subject>rule-antecedent</subject><subject>Searching</subject><subject>Sequences</subject><subject>Sequential pattern mining</subject><subject>sequential rule mining</subject><subject>Spatial databases</subject><subject>Strategy</subject><subject>Time series analysis</subject><issn>1041-4347</issn><issn>1558-2191</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNpNkE1Lw0AQhhdRsFZ_gOAh4Dl1Zr-y8SaxVrG1UOt52aQTSYlJ3DSi_94t9eBph-V55-Nh7BJhggjpzfr5fjrhwMVEcIkcxREboVIm5pjicahBYiyFTE7ZWd9vAcAkBkdstsjaVbyoGvK30cJ9Vx-ujrI2XhbF4D01BUUvbdN-ka9d11XNe_RKnwM1uypwq6GmKGTD9zk7KV3d08XfO2ZvD9N19hjPl7On7G4eFzyVu7jMuXGknRSY6gSAY8kJMCUtiTsuSgOKNBhSuAGxccoocDLXqcoLKXIlxuz60Lfzbdij39ltO_gmjLTcyCTVSukkUHigCt_2vafSdj5c5n8sgt37sntfdu_L_vkKmatDpiKifzwIrgWKXw4NZO4</recordid><startdate>20230901</startdate><enddate>20230901</enddate><creator>Li, Yan</creator><creator>Zhang, Chang</creator><creator>Li, Jie</creator><creator>Song, Wei</creator><creator>Qi, Zhenlian</creator><creator>Wu, Youxi</creator><creator>Wu, Xindong</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0001-5314-3468</orcidid><orcidid>https://orcid.org/0000-0002-2053-4662</orcidid><orcidid>https://orcid.org/0000-0003-0649-8850</orcidid><orcidid>https://orcid.org/0000-0002-1126-9772</orcidid><orcidid>https://orcid.org/0000-0003-2396-1704</orcidid></search><sort><creationdate>20230901</creationdate><title>MCoR-Miner: Maximal Co-Occurrence Nonoverlapping Sequential Rule Mining</title><author>Li, Yan ; Zhang, Chang ; Li, Jie ; Song, Wei ; Qi, Zhenlian ; Wu, Youxi ; Wu, Xindong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c294t-fb28ae6a4319670021f2e019e64e2a23f805e608e51d03da5850a4b695bc43b53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Business competition</topic><topic>co-occurrence pattern</topic><topic>Data mining</topic><topic>Enumeration</topic><topic>Itemsets</topic><topic>Mathematical analysis</topic><topic>maximal rule mining</topic><topic>Mining</topic><topic>Pattern analysis</topic><topic>Pattern matching</topic><topic>Prediction algorithms</topic><topic>Protein sequence</topic><topic>rule-antecedent</topic><topic>Searching</topic><topic>Sequences</topic><topic>Sequential pattern mining</topic><topic>sequential rule mining</topic><topic>Spatial databases</topic><topic>Strategy</topic><topic>Time series analysis</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Li, Yan</creatorcontrib><creatorcontrib>Zhang, Chang</creatorcontrib><creatorcontrib>Li, Jie</creatorcontrib><creatorcontrib>Song, Wei</creatorcontrib><creatorcontrib>Qi, Zhenlian</creatorcontrib><creatorcontrib>Wu, Youxi</creatorcontrib><creatorcontrib>Wu, Xindong</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on knowledge and data engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Li, Yan</au><au>Zhang, Chang</au><au>Li, Jie</au><au>Song, Wei</au><au>Qi, Zhenlian</au><au>Wu, Youxi</au><au>Wu, Xindong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>MCoR-Miner: Maximal Co-Occurrence Nonoverlapping Sequential Rule Mining</atitle><jtitle>IEEE transactions on knowledge and data engineering</jtitle><stitle>TKDE</stitle><date>2023-09-01</date><risdate>2023</risdate><volume>35</volume><issue>9</issue><spage>1</spage><epage>16</epage><pages>1-16</pages><issn>1041-4347</issn><eissn>1558-2191</eissn><coden>ITKEEH</coden><abstract>The aim of sequential pattern mining (SPM) is to discover potentially useful information from a given sequence. Although various SPM methods have been investigated, most of these focus on mining all of the patterns. However, users sometimes want to mine patterns with the same specific prefix pattern, called co-occurrence pattern. Since sequential rule mining can make better use of the results of SPM, and obtain better recommendation performance, this paper addresses the issue of maximal co-occurrence nonoverlapping sequential rule (MCoR) mining and proposes the MCoR-Miner algorithm. To improve the efficiency of support calculation, MCoR-Miner employs depth-first search and backtracking strategies equipped with an indexing mechanism to avoid the use of sequential searching. To obviate useless support calculations for some sequences, MCoR-Miner adopts a filtering strategy to prune the sequences without the prefix pattern. To reduce the number of candidate patterns, MCoR-Miner applies the frequent item and binomial enumeration tree strategies. To avoid searching for the maximal rules through brute force, MCoR-Miner uses a screening strategy. To validate the performance of MCoR-Miner, eleven competitive algorithms were conducted on eight sequences. Our experimental results showed that MCoR-Miner outperformed other competitive algorithms, and yielded better recommendation performance than frequent co-occurrence pattern mining. All algorithms and datasets can be downloaded from https://github.com/wuc567/Pattern-Mining/tree/master/MCoR-Miner .</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TKDE.2023.3241213</doi><tpages>16</tpages><orcidid>https://orcid.org/0000-0001-5314-3468</orcidid><orcidid>https://orcid.org/0000-0002-2053-4662</orcidid><orcidid>https://orcid.org/0000-0003-0649-8850</orcidid><orcidid>https://orcid.org/0000-0002-1126-9772</orcidid><orcidid>https://orcid.org/0000-0003-2396-1704</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1041-4347 |
ispartof | IEEE transactions on knowledge and data engineering, 2023-09, Vol.35 (9), p.1-16 |
issn | 1041-4347 1558-2191 |
language | eng |
recordid | cdi_ieee_primary_10032631 |
source | IEEE Electronic Library (IEL) Journals |
subjects | Algorithms Business competition co-occurrence pattern Data mining Enumeration Itemsets Mathematical analysis maximal rule mining Mining Pattern analysis Pattern matching Prediction algorithms Protein sequence rule-antecedent Searching Sequences Sequential pattern mining sequential rule mining Spatial databases Strategy Time series analysis |
title | MCoR-Miner: Maximal Co-Occurrence Nonoverlapping Sequential Rule Mining |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T21%3A38%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=MCoR-Miner:%20Maximal%20Co-Occurrence%20Nonoverlapping%20Sequential%20Rule%20Mining&rft.jtitle=IEEE%20transactions%20on%20knowledge%20and%20data%20engineering&rft.au=Li,%20Yan&rft.date=2023-09-01&rft.volume=35&rft.issue=9&rft.spage=1&rft.epage=16&rft.pages=1-16&rft.issn=1041-4347&rft.eissn=1558-2191&rft.coden=ITKEEH&rft_id=info:doi/10.1109/TKDE.2023.3241213&rft_dat=%3Cproquest_ieee_%3E2847965567%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c294t-fb28ae6a4319670021f2e019e64e2a23f805e608e51d03da5850a4b695bc43b53%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2847965567&rft_id=info:pmid/&rft_ieee_id=10032631&rfr_iscdi=true |