Data set frequent item set mining availability evaluation method
The invention discloses a data set frequent item set mining availability evaluation method, which comprises the following steps of: (1) setting C = {I1, I2,..., In} as a set of items, giving transaction data sets D1 and D2, and mining D1 and D2 by utilizing an Apriori algorithm to obtain maximum fre...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Patent |
Sprache: | chi ; eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | WU ZHUOCHAO |
description | The invention discloses a data set frequent item set mining availability evaluation method, which comprises the following steps of: (1) setting C = {I1, I2,..., In} as a set of items, giving transaction data sets D1 and D2, and mining D1 and D2 by utilizing an Apriori algorithm to obtain maximum frequent item set sets, and recording the maximum frequent item set sets as FIS1 and FIS2; (2) any item set MIS1 of the FIS1 and any item set MIS2 of the FIS2 are matched through an item set matching algorithm F, a paired item set table Pairs is obtained, the Pairs is composed of item set pairs < MIS1, MIS2 and score1 >, score1 represents the item similarity of the MIS1 and the MIS2, and the item similarity of the MIS1 and the MIS2 is obtained through calculation in the matching process. (3) for each item < MIS1, MIS2, score 1 > in the Pairs, calculating the support degree similarity score 2 of the MIS1 and the MIS2, further calculating to obtain the composite similarity score of the MIS1 and the MIS2, and updating th |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN113568942A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN113568942A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN113568942A3</originalsourceid><addsrcrecordid>eNrjZHBwSSxJVChOLVFIK0otLE3NK1HILEnNBYvkZuZl5qUrJJYlZuYkJmXmZJZUKqSWJeaUJpZk5ucp5KaWZOSn8DCwpiXmFKfyQmluBkU31xBnD93Ugvz41OKCxOTUvNSSeGc_Q0NjUzMLSxMjR2Ni1AAA2yUxlg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Data set frequent item set mining availability evaluation method</title><source>esp@cenet</source><creator>WU ZHUOCHAO</creator><creatorcontrib>WU ZHUOCHAO</creatorcontrib><description>The invention discloses a data set frequent item set mining availability evaluation method, which comprises the following steps of: (1) setting C = {I1, I2,..., In} as a set of items, giving transaction data sets D1 and D2, and mining D1 and D2 by utilizing an Apriori algorithm to obtain maximum frequent item set sets, and recording the maximum frequent item set sets as FIS1 and FIS2; (2) any item set MIS1 of the FIS1 and any item set MIS2 of the FIS2 are matched through an item set matching algorithm F, a paired item set table Pairs is obtained, the Pairs is composed of item set pairs < MIS1, MIS2 and score1 >, score1 represents the item similarity of the MIS1 and the MIS2, and the item similarity of the MIS1 and the MIS2 is obtained through calculation in the matching process. (3) for each item < MIS1, MIS2, score 1 > in the Pairs, calculating the support degree similarity score 2 of the MIS1 and the MIS2, further calculating to obtain the composite similarity score of the MIS1 and the MIS2, and updating th</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; HANDLING RECORD CARRIERS ; PHYSICS ; PRESENTATION OF DATA ; RECOGNITION OF DATA ; RECORD CARRIERS</subject><creationdate>2021</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20211029&DB=EPODOC&CC=CN&NR=113568942A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,309,781,886,25569,76552</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20211029&DB=EPODOC&CC=CN&NR=113568942A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>WU ZHUOCHAO</creatorcontrib><title>Data set frequent item set mining availability evaluation method</title><description>The invention discloses a data set frequent item set mining availability evaluation method, which comprises the following steps of: (1) setting C = {I1, I2,..., In} as a set of items, giving transaction data sets D1 and D2, and mining D1 and D2 by utilizing an Apriori algorithm to obtain maximum frequent item set sets, and recording the maximum frequent item set sets as FIS1 and FIS2; (2) any item set MIS1 of the FIS1 and any item set MIS2 of the FIS2 are matched through an item set matching algorithm F, a paired item set table Pairs is obtained, the Pairs is composed of item set pairs < MIS1, MIS2 and score1 >, score1 represents the item similarity of the MIS1 and the MIS2, and the item similarity of the MIS1 and the MIS2 is obtained through calculation in the matching process. (3) for each item < MIS1, MIS2, score 1 > in the Pairs, calculating the support degree similarity score 2 of the MIS1 and the MIS2, further calculating to obtain the composite similarity score of the MIS1 and the MIS2, and updating th</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>HANDLING RECORD CARRIERS</subject><subject>PHYSICS</subject><subject>PRESENTATION OF DATA</subject><subject>RECOGNITION OF DATA</subject><subject>RECORD CARRIERS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2021</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHBwSSxJVChOLVFIK0otLE3NK1HILEnNBYvkZuZl5qUrJJYlZuYkJmXmZJZUKqSWJeaUJpZk5ucp5KaWZOSn8DCwpiXmFKfyQmluBkU31xBnD93Ugvz41OKCxOTUvNSSeGc_Q0NjUzMLSxMjR2Ni1AAA2yUxlg</recordid><startdate>20211029</startdate><enddate>20211029</enddate><creator>WU ZHUOCHAO</creator><scope>EVB</scope></search><sort><creationdate>20211029</creationdate><title>Data set frequent item set mining availability evaluation method</title><author>WU ZHUOCHAO</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN113568942A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2021</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>HANDLING RECORD CARRIERS</topic><topic>PHYSICS</topic><topic>PRESENTATION OF DATA</topic><topic>RECOGNITION OF DATA</topic><topic>RECORD CARRIERS</topic><toplevel>online_resources</toplevel><creatorcontrib>WU ZHUOCHAO</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>WU ZHUOCHAO</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Data set frequent item set mining availability evaluation method</title><date>2021-10-29</date><risdate>2021</risdate><abstract>The invention discloses a data set frequent item set mining availability evaluation method, which comprises the following steps of: (1) setting C = {I1, I2,..., In} as a set of items, giving transaction data sets D1 and D2, and mining D1 and D2 by utilizing an Apriori algorithm to obtain maximum frequent item set sets, and recording the maximum frequent item set sets as FIS1 and FIS2; (2) any item set MIS1 of the FIS1 and any item set MIS2 of the FIS2 are matched through an item set matching algorithm F, a paired item set table Pairs is obtained, the Pairs is composed of item set pairs < MIS1, MIS2 and score1 >, score1 represents the item similarity of the MIS1 and the MIS2, and the item similarity of the MIS1 and the MIS2 is obtained through calculation in the matching process. (3) for each item < MIS1, MIS2, score 1 > in the Pairs, calculating the support degree similarity score 2 of the MIS1 and the MIS2, further calculating to obtain the composite similarity score of the MIS1 and the MIS2, and updating th</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | chi ; eng |
recordid | cdi_epo_espacenet_CN113568942A |
source | esp@cenet |
subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING HANDLING RECORD CARRIERS PHYSICS PRESENTATION OF DATA RECOGNITION OF DATA RECORD CARRIERS |
title | Data set frequent item set mining availability evaluation method |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-12T19%3A54%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=WU%20ZHUOCHAO&rft.date=2021-10-29&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN113568942A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |