Hiding Sensitive Association Rules by Elimination Selective Item among R.H.S Items for each Selective Transaction

This article focuses on hiding sensitive association rule, which is an important research problem in privacy preserving data mining. For this, the authors have presented an algorithm that decreases confidence of sensitive rules to below minimum threshold by removing selective item among items of con...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Indian journal of science and technology 2014-06, Vol.7 (6), p.826-832
1. Verfasser:	Ramezani, Atefe
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Confidence Data mining Preserving Privacy Thresholds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	832
container_issue	6
container_start_page	826
container_title	Indian journal of science and technology
container_volume	7
creator	Ramezani, Atefe
description	This article focuses on hiding sensitive association rule, which is an important research problem in privacy preserving data mining. For this, the authors have presented an algorithm that decreases confidence of sensitive rules to below minimum threshold by removing selective item among items of consequent sensitive rule for each selective transaction. Finally, they qualitatively compare the efficiency of the proposed algorithm with that of already published algorithms in hiding association rules.
doi_str_mv	10.17485/ijst/2014/v7i6.17
format	Article
fullrecord	<record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1567112699</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1567112699</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1907-963c365caace284cd4d4dac80a5aeceee3da844e42c466fdfd0f68eafb6656d3</originalsourceid><addsrcrecordid>eNpNkE1vwjAMhqNpk4YYf2CnHHcpJG2StkeE2EBCmkS5RyZ1t6B-QF2Q-PdrgcPsg61Hj314GXuXYipjleiZP1A3C4VUs0vsTQ-f2EiksQq0Ufr5sZtEmVc2ITqIvqIwEbEYsdPK577-4RnW5Dt_QT4napyHzjc1355LJL6_8mXpK1_fYYYlupu67rDiUDX9_Xa6mmY3QLxoWo7gfv-ZuxZqAjfcv7GXAkrCyWOO2e5zuVusgs3313ox3wROpiIOUhO5yGgH4DBMlMtV3-ASARrQIWKUQ6IUqtApY4q8yEVhEoRib4w2eTRmH_e3x7Y5nZE6W3lyWJZQY3MmK7WJpQxNmvZqeFdd2xC1WNhj6ytor1YKe0vYDgnbIWE7JNzD6A_4EnLT</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1567112699</pqid></control><display><type>article</type><title>Hiding Sensitive Association Rules by Elimination Selective Item among R.H.S Items for each Selective Transaction</title><source>Free E-Journal (出版社公開部分のみ）</source><creator>Ramezani, Atefe</creator><creatorcontrib>Ramezani, Atefe</creatorcontrib><description>This article focuses on hiding sensitive association rule, which is an important research problem in privacy preserving data mining. For this, the authors have presented an algorithm that decreases confidence of sensitive rules to below minimum threshold by removing selective item among items of consequent sensitive rule for each selective transaction. Finally, they qualitatively compare the efficiency of the proposed algorithm with that of already published algorithms in hiding association rules.</description><identifier>ISSN: 0974-6846</identifier><identifier>EISSN: 0974-5645</identifier><identifier>DOI: 10.17485/ijst/2014/v7i6.17</identifier><language>eng</language><subject>Algorithms ; Confidence ; Data mining ; Preserving ; Privacy ; Thresholds</subject><ispartof>Indian journal of science and technology, 2014-06, Vol.7 (6), p.826-832</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Ramezani, Atefe</creatorcontrib><title>Hiding Sensitive Association Rules by Elimination Selective Item among R.H.S Items for each Selective Transaction</title><title>Indian journal of science and technology</title><description>This article focuses on hiding sensitive association rule, which is an important research problem in privacy preserving data mining. For this, the authors have presented an algorithm that decreases confidence of sensitive rules to below minimum threshold by removing selective item among items of consequent sensitive rule for each selective transaction. Finally, they qualitatively compare the efficiency of the proposed algorithm with that of already published algorithms in hiding association rules.</description><subject>Algorithms</subject><subject>Confidence</subject><subject>Data mining</subject><subject>Preserving</subject><subject>Privacy</subject><subject>Thresholds</subject><issn>0974-6846</issn><issn>0974-5645</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNpNkE1vwjAMhqNpk4YYf2CnHHcpJG2StkeE2EBCmkS5RyZ1t6B-QF2Q-PdrgcPsg61Hj314GXuXYipjleiZP1A3C4VUs0vsTQ-f2EiksQq0Ufr5sZtEmVc2ITqIvqIwEbEYsdPK577-4RnW5Dt_QT4napyHzjc1355LJL6_8mXpK1_fYYYlupu67rDiUDX9_Xa6mmY3QLxoWo7gfv-ZuxZqAjfcv7GXAkrCyWOO2e5zuVusgs3313ox3wROpiIOUhO5yGgH4DBMlMtV3-ASARrQIWKUQ6IUqtApY4q8yEVhEoRib4w2eTRmH_e3x7Y5nZE6W3lyWJZQY3MmK7WJpQxNmvZqeFdd2xC1WNhj6ytor1YKe0vYDgnbIWE7JNzD6A_4EnLT</recordid><startdate>20140620</startdate><enddate>20140620</enddate><creator>Ramezani, Atefe</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>8BQ</scope><scope>8FD</scope><scope>JG9</scope></search><sort><creationdate>20140620</creationdate><title>Hiding Sensitive Association Rules by Elimination Selective Item among R.H.S Items for each Selective Transaction</title><author>Ramezani, Atefe</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1907-963c365caace284cd4d4dac80a5aeceee3da844e42c466fdfd0f68eafb6656d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Confidence</topic><topic>Data mining</topic><topic>Preserving</topic><topic>Privacy</topic><topic>Thresholds</topic><toplevel>online_resources</toplevel><creatorcontrib>Ramezani, Atefe</creatorcontrib><collection>CrossRef</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Materials Research Database</collection><jtitle>Indian journal of science and technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ramezani, Atefe</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Hiding Sensitive Association Rules by Elimination Selective Item among R.H.S Items for each Selective Transaction</atitle><jtitle>Indian journal of science and technology</jtitle><date>2014-06-20</date><risdate>2014</risdate><volume>7</volume><issue>6</issue><spage>826</spage><epage>832</epage><pages>826-832</pages><issn>0974-6846</issn><eissn>0974-5645</eissn><abstract>This article focuses on hiding sensitive association rule, which is an important research problem in privacy preserving data mining. For this, the authors have presented an algorithm that decreases confidence of sensitive rules to below minimum threshold by removing selective item among items of consequent sensitive rule for each selective transaction. Finally, they qualitatively compare the efficiency of the proposed algorithm with that of already published algorithms in hiding association rules.</abstract><doi>10.17485/ijst/2014/v7i6.17</doi><tpages>7</tpages><oa>free_for_read</oa></addata></record>
fulltext	fulltext
identifier	ISSN: 0974-6846
ispartof	Indian journal of science and technology, 2014-06, Vol.7 (6), p.826-832
issn	0974-6846 0974-5645
language	eng
recordid	cdi_proquest_miscellaneous_1567112699
source	Free E-Journal (出版社公開部分のみ）
subjects	Algorithms Confidence Data mining Preserving Privacy Thresholds
title	Hiding Sensitive Association Rules by Elimination Selective Item among R.H.S Items for each Selective Transaction
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T08%3A59%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Hiding%20Sensitive%20Association%20Rules%20by%20Elimination%20Selective%20Item%20among%20R.H.S%20Items%20for%20each%20Selective%20Transaction&rft.jtitle=Indian%20journal%20of%20science%20and%20technology&rft.au=Ramezani,%20Atefe&rft.date=2014-06-20&rft.volume=7&rft.issue=6&rft.spage=826&rft.epage=832&rft.pages=826-832&rft.issn=0974-6846&rft.eissn=0974-5645&rft_id=info:doi/10.17485/ijst/2014/v7i6.17&rft_dat=%3Cproquest_cross%3E1567112699%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1567112699&rft_id=info:pmid/&rfr_iscdi=true