A FP-Tree-Based Method for Inverse Frequent Set Mining
Recently, the inverse frequent set mining problem has received more attention because of its important applications in different privacy preserving data sharing contexts. Several studies were reported to probe the NP-complete problem of inverse frequent set mining. However, it is still an open probl...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 163 |
|---|---|
| container_issue | |
| container_start_page | 152 |
| container_title | |
| container_volume | |
| creator | Guo, Yuhong Tong, Yuhai Tang, Shiwei Yang, Dongqing |
| description | Recently, the inverse frequent set mining problem has received more attention because of its important applications in different privacy preserving data sharing contexts. Several studies were reported to probe the NP-complete problem of inverse frequent set mining. However, it is still an open problem that whether there are reasonably efficient search strategies to find a compatible data set in practice. In this paper, we propose a FP-tree-based method for the inverse problem. Compared with previous “generation-and-test” methods, our method is a zero trace back algorithm, which saves huge computational costs. Furthermore, our algorithm provides a good heuristic search strategy to rapidly find a FP-tree, leading to rapidly finding the compatible databases. More importantly, our method can find a set of compatible databases instead of finding only one compatible database in previous methods. |
| doi_str_mv | 10.1007/11788911_13 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19131347</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19131347</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-2b5b7e631ff7db604503ee68018b28e4f585539beb447db90cd6fd7ceb6564813</originalsourceid><addsrcrecordid>eNpNkDtPwzAUhc1LopRO_IEsDAwG31w_4rFUFCq1AokyR3FyXQIlCXZA4t8TVIQ4yxnOpzN8jJ2BuAQhzBWAyTILkAPusRNUUqCyBsQ-G4EG4IjSHvwN2tpDNhIoUm6NxGM2ifFFDEEwWpsR09Nk_sDXgYhfF5GqZEX9c1slvg3JovmkECmZB3r_oKZPHqlPVnVTN5tTduSLbaTJb4_Z0_xmPbvjy_vbxWy65F0KtuepU86QRvDeVE4LqQQS6UxA5tKMpFeZUmgdOSkHwIqy0r4yJTmttMwAx-x899sVsSy2PhRNWce8C_VbEb5ysICA0gzcxY6Lw9RsKOSubV9jDiL_sZb_s4bfNChXcA</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A FP-Tree-Based Method for Inverse Frequent Set Mining</title><source>Springer Books</source><creator>Guo, Yuhong ; Tong, Yuhai ; Tang, Shiwei ; Yang, Dongqing</creator><contributor>Bell, David A. ; Hong, Jun</contributor><creatorcontrib>Guo, Yuhong ; Tong, Yuhai ; Tang, Shiwei ; Yang, Dongqing ; Bell, David A. ; Hong, Jun</creatorcontrib><description>Recently, the inverse frequent set mining problem has received more attention because of its important applications in different privacy preserving data sharing contexts. Several studies were reported to probe the NP-complete problem of inverse frequent set mining. However, it is still an open problem that whether there are reasonably efficient search strategies to find a compatible data set in practice. In this paper, we propose a FP-tree-based method for the inverse problem. Compared with previous “generation-and-test” methods, our method is a zero trace back algorithm, which saves huge computational costs. Furthermore, our algorithm provides a good heuristic search strategy to rapidly find a FP-tree, leading to rapidly finding the compatible databases. More importantly, our method can find a set of compatible databases instead of finding only one compatible database in previous methods.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540359699</identifier><identifier>ISBN: 9783540359692</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540359710</identifier><identifier>EISBN: 9783540359715</identifier><identifier>DOI: 10.1007/11788911_13</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Frequent Item ; Frequent Itemset Mining ; Information systems. Data bases ; Memory organisation. Data processing ; Minimum Support Threshold ; Software ; Transaction Database ; Zero Trace</subject><ispartof>Flexible and Efficient Information Handling, 2006, p.152-163</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2007 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11788911_13$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11788911_13$$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=19131347$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Bell, David A.</contributor><contributor>Hong, Jun</contributor><creatorcontrib>Guo, Yuhong</creatorcontrib><creatorcontrib>Tong, Yuhai</creatorcontrib><creatorcontrib>Tang, Shiwei</creatorcontrib><creatorcontrib>Yang, Dongqing</creatorcontrib><title>A FP-Tree-Based Method for Inverse Frequent Set Mining</title><title>Flexible and Efficient Information Handling</title><description>Recently, the inverse frequent set mining problem has received more attention because of its important applications in different privacy preserving data sharing contexts. Several studies were reported to probe the NP-complete problem of inverse frequent set mining. However, it is still an open problem that whether there are reasonably efficient search strategies to find a compatible data set in practice. In this paper, we propose a FP-tree-based method for the inverse problem. Compared with previous “generation-and-test” methods, our method is a zero trace back algorithm, which saves huge computational costs. Furthermore, our algorithm provides a good heuristic search strategy to rapidly find a FP-tree, leading to rapidly finding the compatible databases. More importantly, our method can find a set of compatible databases instead of finding only one compatible database in previous methods.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Frequent Item</subject><subject>Frequent Itemset Mining</subject><subject>Information systems. Data bases</subject><subject>Memory organisation. Data processing</subject><subject>Minimum Support Threshold</subject><subject>Software</subject><subject>Transaction Database</subject><subject>Zero Trace</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540359699</isbn><isbn>9783540359692</isbn><isbn>3540359710</isbn><isbn>9783540359715</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkDtPwzAUhc1LopRO_IEsDAwG31w_4rFUFCq1AokyR3FyXQIlCXZA4t8TVIQ4yxnOpzN8jJ2BuAQhzBWAyTILkAPusRNUUqCyBsQ-G4EG4IjSHvwN2tpDNhIoUm6NxGM2ifFFDEEwWpsR09Nk_sDXgYhfF5GqZEX9c1slvg3JovmkECmZB3r_oKZPHqlPVnVTN5tTduSLbaTJb4_Z0_xmPbvjy_vbxWy65F0KtuepU86QRvDeVE4LqQQS6UxA5tKMpFeZUmgdOSkHwIqy0r4yJTmttMwAx-x899sVsSy2PhRNWce8C_VbEb5ysICA0gzcxY6Lw9RsKOSubV9jDiL_sZb_s4bfNChXcA</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Guo, Yuhong</creator><creator>Tong, Yuhai</creator><creator>Tang, Shiwei</creator><creator>Yang, Dongqing</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>A FP-Tree-Based Method for Inverse Frequent Set Mining</title><author>Guo, Yuhong ; Tong, Yuhai ; Tang, Shiwei ; Yang, Dongqing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-2b5b7e631ff7db604503ee68018b28e4f585539beb447db90cd6fd7ceb6564813</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Frequent Item</topic><topic>Frequent Itemset Mining</topic><topic>Information systems. Data bases</topic><topic>Memory organisation. Data processing</topic><topic>Minimum Support Threshold</topic><topic>Software</topic><topic>Transaction Database</topic><topic>Zero Trace</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Guo, Yuhong</creatorcontrib><creatorcontrib>Tong, Yuhai</creatorcontrib><creatorcontrib>Tang, Shiwei</creatorcontrib><creatorcontrib>Yang, Dongqing</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Guo, Yuhong</au><au>Tong, Yuhai</au><au>Tang, Shiwei</au><au>Yang, Dongqing</au><au>Bell, David A.</au><au>Hong, Jun</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A FP-Tree-Based Method for Inverse Frequent Set Mining</atitle><btitle>Flexible and Efficient Information Handling</btitle><date>2006</date><risdate>2006</risdate><spage>152</spage><epage>163</epage><pages>152-163</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540359699</isbn><isbn>9783540359692</isbn><eisbn>3540359710</eisbn><eisbn>9783540359715</eisbn><abstract>Recently, the inverse frequent set mining problem has received more attention because of its important applications in different privacy preserving data sharing contexts. Several studies were reported to probe the NP-complete problem of inverse frequent set mining. However, it is still an open problem that whether there are reasonably efficient search strategies to find a compatible data set in practice. In this paper, we propose a FP-tree-based method for the inverse problem. Compared with previous “generation-and-test” methods, our method is a zero trace back algorithm, which saves huge computational costs. Furthermore, our algorithm provides a good heuristic search strategy to rapidly find a FP-tree, leading to rapidly finding the compatible databases. More importantly, our method can find a set of compatible databases instead of finding only one compatible database in previous methods.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11788911_13</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Flexible and Efficient Information Handling, 2006, p.152-163 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_19131347 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Exact sciences and technology Frequent Item Frequent Itemset Mining Information systems. Data bases Memory organisation. Data processing Minimum Support Threshold Software Transaction Database Zero Trace |
| title | A FP-Tree-Based Method for Inverse Frequent Set Mining |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T10%3A12%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20FP-Tree-Based%20Method%20for%20Inverse%20Frequent%20Set%20Mining&rft.btitle=Flexible%20and%20Efficient%20Information%20Handling&rft.au=Guo,%20Yuhong&rft.date=2006&rft.spage=152&rft.epage=163&rft.pages=152-163&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540359699&rft.isbn_list=9783540359692&rft_id=info:doi/10.1007/11788911_13&rft_dat=%3Cpascalfrancis_sprin%3E19131347%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540359710&rft.eisbn_list=9783540359715&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |