Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: k-anonymity is an efficient way to anonymize the relational data to protect privacy against re-identification attacks. For the purpose of k-anonymity on transaction data, each item is considered as the quasi-identifier attribute, thus increasing high dimension problem as ll as the computational complexity and information loss for anonymity. , an efficient anonymity system is designed to not only anonymize transaction data with lor information loss but also reduce the computational complexity for anonymity. An extensive experiment is carried to show the efficiency of the designed approach compared to the state-of-the-art algorithms for anonymity in terms of runtime and information loss. Experimental results indicate that the proposed anonymous system outperforms the compared algorithms in all respects.
['Jerry Chun-Wei Lin', 'Qiankun Liu', 'Philippe Fournier-Viger', 'Tzung-Pei Hong', 'Justin Zhan', 'Miroslav Voznak']
I am writing a research paper on a idea An Efficient Anonymous System for Transaction Data
[{"from": "human", "value": "I am writing a research paper on a idea An Efficient Anonymous System for Transaction Data"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: k-anonymity is an efficient way to anonymize the relational data to protect privacy against re-identification attacks. For the purpose of k-anonymity on transaction data, each item is considered as the quasi-identifier attribute, thus increasing high dimension problem as ll as the computational complexity and information loss for anonymity. , an efficient anonymity system is designed to not only anonymize transaction data with lor information loss but also reduce the computational complexity for anonymity. An extensive experiment is carried to show the efficiency of the designed approach compared to the state-of-the-art algorithms for anonymity in terms of runtime and information loss. Experimental results indicate that the proposed anonymous system outperforms the compared algorithms in all respects."}]