Готові списки джерел за темами / RULE HIDING

Добірка наукової літератури з теми "RULE HIDING"

Автор: Grafiati
Опубліковано: 11 вересня 2023
Оновлено: 16 квітня 2024

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "RULE HIDING".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "RULE HIDING"

1

Verykios, V. S., A. K. Elmagarmid, E. Bertino, Y. Saygin, and E. Dasseni. "Association rule hiding." IEEE Transactions on Knowledge and Data Engineering 16, no. 4 (April 2004): 434–47. http://dx.doi.org/10.1109/tkde.2004.1269668.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Khurana, Garvit. "Association Rule Hiding using Hash Tree." International Journal of Trend in Scientific Research and Development Volume-3, Issue-3 (April 30, 2019): 787–89. http://dx.doi.org/10.31142/ijtsrd23037.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Quoc Le, Hai, Somjit Arch-int, and Ngamnij Arch-int. "Association Rule Hiding Based on Intersection Lattice." Mathematical Problems in Engineering 2013 (2013): 1–11. http://dx.doi.org/10.1155/2013/210405.

Повний текст джерела
Анотація:
Association rule hiding has been playing a vital role in sensitive knowledge preservation when sharing data between enterprises. The aim of association rule hiding is to remove sensitive association rules from the released database such that side effects are reduced as low as possible. This research proposes an efficient algorithm for hiding a specified set of sensitive association rules based on intersection lattice of frequent itemsets. In this research, we begin by analyzing the theory of the intersection lattice of frequent itemsets and the applicability of this theory into association rule hiding problem. We then formulate two heuristics in order to (a) specify the victim items based on the characteristics of the intersection lattice of frequent itemsets and (b) identify transactions for data sanitization based on the weight of transactions. Next, we propose a new algorithm for hiding a specific set of sensitive association rules with minimum side effects and low complexity. Finally, experiments were carried out to clarify the efficiency of the proposed approach. Our results showed that the proposed algorithm, AARHIL, achieved minimum side effects and CPU-Time when compared to current similar state of the art approaches in the context of hiding a specified set of sensitive association rules.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Wang, Hui. "Hiding Sensitive Association Rules by Sanitizing." Advanced Materials Research 694-697 (May 2013): 2317–21. http://dx.doi.org/10.4028/www.scientific.net/amr.694-697.2317.

Повний текст джерела
Анотація:
The goal of knowledge discovery is to extract hidden or useful unknown knowledge from databases, while the objective of knowledge hiding is to prevent certain confidential data or knowledge from being extracted through data mining techniques. Hiding sensitive association rules is focused. The side-effects of the existing data mining technology are investigated. The problem of sensitive association rule hiding is described formally. The representative sanitizing strategies for sensitive association rule hiding are discussed.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Mohan, S. Vijayarani, and Tamilarasi Angamuthu. "Association Rule Hiding in Privacy Preserving Data Mining." International Journal of Information Security and Privacy 12, no. 3 (July 2018): 141–63. http://dx.doi.org/10.4018/ijisp.2018070108.

Повний текст джерела
Анотація:
This article describes how privacy preserving data mining has become one of the most important and interesting research directions in data mining. With the help of data mining techniques, people can extract hidden information and discover patterns and relationships between the data items. In most of the situations, the extracted knowledge contains sensitive information about individuals and organizations. Moreover, this sensitive information can be misused for various purposes which violate the individual's privacy. Association rules frequently predetermine significant target marketing information about a business. Significant association rules provide knowledge to the data miner as they effectively summarize the data, while uncovering any hidden relations among items that hold in the data. Association rule hiding techniques are used for protecting the knowledge extracted by the sensitive association rules during the process of association rule mining. Association rule hiding refers to the process of modifying the original database in such a way that certain sensitive association rules disappear without seriously affecting the data and the non-sensitive rules. In this article, two new hiding techniques are proposed namely hiding technique based on genetic algorithm (HGA) and dummy items creation (DIC) technique. Hiding technique based on genetic algorithm is used for hiding sensitive association rules and the dummy items creation technique hides the sensitive rules as well as it creates dummy items for the modified sensitive items. Experimental results show the performance of the proposed techniques.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Verykios, Vassilios S. "Association rule hiding methods." Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 3, no. 1 (January 2013): 28–36. http://dx.doi.org/10.1002/widm.1082.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Wang, Hui. "Strategies for Sensitive Association Rule Hiding." Applied Mechanics and Materials 336-338 (July 2013): 2203–6. http://dx.doi.org/10.4028/www.scientific.net/amm.336-338.2203.

Повний текст джерела
Анотація:
Data mining technologies are used widely while the side effects it incurred are concerned so seriously. Privacy preserving data mining is so important for data and knowledge security during data mining applications. Association rule extracted from data mining is one kind of the most popular knowledge. It is challenging to hide sensitive association rules extracted by data mining process and make less affection on non-sensitive rules and the original database. In this work, we focus on specific association rule automatic hiding. Novel strategies are proposed which are based on increasing the support of the left hand and decreasing the support of the right hand. Quality measurements for sensitive association rules hiding are presented.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Öztürk, Ahmet Cumhur, and Belgin Ergenç. "Dynamic Itemset Hiding Algorithm for Multiple Sensitive Support Thresholds." International Journal of Data Warehousing and Mining 14, no. 2 (April 2018): 37–59. http://dx.doi.org/10.4018/ijdwm.2018040103.

Повний текст джерела
Анотація:
This article describes how association rule mining is used for extracting relations between items in transactional databases and is beneficial for decision-making. However, association rule mining can pose a threat to the privacy of the knowledge when the data is shared without hiding the confidential association rules of the data owner. One of the ways hiding an association rule from the database is to conceal the itemsets (co-occurring items) from which the sensitive association rules are generated. These sensitive itemsets are sanitized by the itemset hiding processes. Most of the existing solutions consider single support thresholds and assume that the databases are static, which is not true in real life. In this article, the authors propose a novel itemset hiding algorithm designed for the dynamic database environment and consider multiple itemset support thresholds. Performance comparisons of the algorithm is done with two dynamic algorithms on six different databases. Findings show that their dynamic algorithm is more efficient in terms of execution time and information loss and guarantees to hide all sensitive itemsets.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Wang, Shyue-Liang, Bhavesh Parikh, and Ayat Jafari. "Hiding informative association rule sets." Expert Systems with Applications 33, no. 2 (August 2007): 316–23. http://dx.doi.org/10.1016/j.eswa.2006.05.022.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

B., Suma, and Shobha G. "Privacy preserving association rule hiding using border based approach." Indonesian Journal of Electrical Engineering and Computer Science 23, no. 2 (August 1, 2021): 1137. http://dx.doi.org/10.11591/ijeecs.v23.i2.pp1137-1145.

Повний текст джерела
Анотація:
<div>Association rule mining is a well-known data mining technique used for extracting hidden correlations between data items in large databases. In the majority of the situations, data mining results contain sensitive information about individuals and publishing such data will violate individual secrecy. The challenge of association rule mining is to preserve the confidentiality of sensitive rules when releasing the database to external parties. The association rule hiding technique conceals the knowledge extracted by the sensitive association rules by modifying the database. In this paper, we introduce a border-based algorithm for hiding sensitive association rules. The main purpose of this approach is to conceal the sensitive rule set while maintaining the utility of the database and association rule mining results at the highest level. The performance of the algorithm in terms of the side effects is demonstrated using experiments conducted on two real datasets. The results show that the information loss is minimized without sacrificing the accuracy. </div>
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "RULE HIDING"

1

LaMacchia, Carolyn. "Improving the Scalability of an Exact Approach for Frequent Item Set Hiding." NSUWorks, 2013. http://nsuworks.nova.edu/gscis_etd/205.

Повний текст джерела
Анотація:
Technological advances have led to the generation of large databases of organizational data recognized as an information-rich, strategic asset for internal analysis and sharing with trading partners. Data mining techniques can discover patterns in large databases including relationships considered strategically relevant to the owner of the data. The frequent item set hiding problem is an area of active research to study approaches for hiding the sensitive knowledge patterns before disclosing the data outside the organization. Several methods address hiding sensitive item sets including an exact approach that generates an extension to the original database that, when combined with the original database, limits the discovery of sensitive association rules without impacting other non-sensitive information. To generate the database extension, this method formulates a constraint optimization problem (COP). Solving the COP formulation is the dominant factor in the computational resource requirements of the exact approach. This dissertation developed heuristics that address the scalability of the exact hiding method. The heuristics are directed at improving the performance of COP solver by reducing the size of the COP formulation without significantly affecting the quality of the solutions generated. The first heuristic decomposes the COP formulation into multiple smaller problem instances that are processed separately by the COP solver to generate partial extensions of the database. The smaller database extensions are then combined to form a database extension that is close to the database extension generated with the original, larger COP formulation. The second heuristic evaluates the revised border used to formulate the COP and reduces the number of variables and constraints by selectively substituting multiple item sets with composite variables. Solving the COP with fewer variables and constraints reduces the computational cost of the processing. Results of heuristic processing were compared with an existing exact approach based on the size of the database extension, the ability to hide sensitive data, and the impact on nonsensitive data.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

VARSHNEY, PEEYUSH. "CLOUD FRAMEWORK FOR ASSOCIATION RULE HIDING." Thesis, 2017. http://dspace.dtu.ac.in:8080/jspui/handle/repository/16143.

Повний текст джерела
Анотація:
Data mining process are followed an extensive undertaking of research and product improvement. This development started when enterprise material was first loaded on computers, continued with advancement in data access, and more recently, developed technologies that permit users to transport through their data in real time. APRIORI algorithm, a popular data mining technique and compared the performances of a linked list based implementation as a basis and a tries-based implementation on it for mining frequent item sequences in a transactional database. In this report, I study the data structure, implementation and algorithmic features mainly focusing on those that also arise in frequent item set mining. This algorithm has given us new capabilities to identify associations in large data sets. However, a fundamental issue, and still not adequately examined, is demand to balance the privacy of the revealed data with the legitimate needs of the data users. The rule is characterizing as sensitive if its disclosure threat is above a certain privacy threshold. Sometimes, sensitive rules should not disclose to the public, since among other things, they may use for inferring sensitive data, or they may offer enterprise competitors with an advantage. Therefore, next I worked with some association rule hiding algorithms and examined their performances to analyse their time complexity orderly and the affect that they have in the original database.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

VARSHNEY, PEEYUSH. "CLOUD FRAMEWORK FOR ASSOCIATION RULE HIDING." Thesis, 2017. http://dspace.dtu.ac.in:8080/jspui/handle/repository/16318.

Повний текст джерела
Анотація:
Data mining techniques are the result of a long process of research and product development. This evolution began when business data was first stored on computers, continued with improvements in data access, and more recently, generated technologies that allow users to navigate through their data in real time. APRIORI algorithm, a popular data mining technique and compared the performances of a linked list based implementation as a basis and a tries-based implementation on it for mining frequent item sequences in a transactional database. In this report, I examine the data structure, implementation and algorithmic features mainly focusing on those that also arise in frequent item set mining. This algorithm has given us new capabilities to identify associations in large data sets. However, a key problem, and still not sufficiently investigated, is the need to balance the confidentiality of the disclosed data with the legitimate needs of the data users. One rule is characterized as sensitive if its disclosure risk is above a certain privacy threshold. Sometimes, sensitive rules should not be disclosed to the public, since among other things, they may be used for inferring sensitive data, or they may provide business competitors with an advantage. Therefore, next I worked with some association rule hiding algorithms and examined their performances in order to analyse their time complexity and the impact that they have in the original database.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Saikia, Bikramjit, and Debkumar Bhowmik. "Study of Association Rule Mining and Different Hiding Techniques." Thesis, 2009. http://ethesis.nitrkl.ac.in/991/1/Thesis.pdf.

Повний текст джерела
Анотація:
Data mining is the process of extracting hidden patterns from data. As more data is gathered,with the amount of data doubling every three years, data mining is becoming an increasingly important tool to transform this data into information. In this paper, we first focused on APRIORI algorithm, a popular data mining technique and compared the performances of a linked list based implementation as a basis and a tries-based implementation on it for mining frequent item sequences in a transactional database. We examined the data structure, implementation and algorithmic features mainly focusing on those that also arise in frequent item set mining. This algorithm has given us new capabilities to identify associations in large data sets. But a key problem, and still not sufficiently investigated, is the need to balance the confidentiality of the disclosed data with the legitimate needs of the data users. One rule is characterized as sensitive if its disclosure risk is above a certain privacy threshold. Sometimes, sensitive rules should not be disclosed to the public, since among other things, they may be used for inferring sensitive data, or they may provide business competitors with an advantage. So, next we worked with some association rule hiding algorithms and examined their performances in order to analyze their time complexity and the impact that they have in the original database. We worked on two different side effects – one was the number of new rules generated during the hiding process and the other one was the number of non-sensitive rules lost during the process.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Chiang, Chia Ming, and 江家明. "A New Approach for Sensitive Rule Hiding by Considering Side Effects." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/96048877295787722429.

Повний текст джерела
Анотація:
碩士
國立清華大學
資訊工程學系
91
As the growth of computer technology has been advanced, the amount of data has been increasing with an extremely fast rate. A variety of methods for knowledge discovery and data mining have been developed to help people digest the huge number of data. One of the popular data mining research issues is association rule mining. Based on the techniques for mining association rules, the correlations between data items can be identified. However, the misuses of these methods may bring undesired side effects to the people. Recently, researchers have made great efforts at hiding association rules. In this thesis, we develop a new approach that can hide the sensitive information without generating undesired side effects. Our approach consists of three steps corresponding to three possible problems. At first, we adopt the template concept to identify either the set of modifiable transactions or the set of probably affected association rules. For efficiency, we design indexing facilities for fast retrieval of the required information in the transaction database. Second, among the selected transactions for hiding sensitive rules, we further select the transactions that will not hide any of the non-sensitive rules. At the third step, we examine these selected transactions to avoid generating extra rules. Iteratively, sensitive rules can be hidden and the undesired side effects are avoided. In the experiments, we show the effectiveness of our approach according to the three conditions and analyze the performance of different methods for database modifications. Moreover, the results also show that our proposed approach has perfect scalability to the database size. Specifically, the time of the approach that considers all the three conditions is just a little bit slower than the time of the one that do not consider the two side effects.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Chan, Ching-yi, and 詹景逸. "A Study for Association Rule Hiding Using the Evaluation of Side-Effec." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/44956271738886770834.

Повний текст джерела
Анотація:
碩士
國立臺南大學
資訊教育研究所碩士班
93
Data mining technology has given us new capabilities to identify correlations in large data sets. This introduces risks when the data is to be made public, but the correlations are private. There are some algorithm removing individual values from a database to prevent the discovery of a set of rules, while preserving the data for other applications. However it causes another problem "the side effect" that is a NP-Hard problem proofed by Atallah. We introduce a new perspective where is "Side Effect Cost Evaluation" to solve this problem. The efficacy and time requirement of this method are discussed. We also present an experiment showing an example of this methodology.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Yang, Jei-Hung, and 楊介宏. "Hiding Sensitive Rules Based on Transaction Grouping." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/58538882177123969090.

Повний текст джерела
Анотація:
碩士
中原大學
資訊工程研究所
98
As the prevalent development of network technology, information sharing and communication is frequent in daily life. Although data mining techniques help people find the important rules among data, people also have to take the risk of sensitive information disclosed. In addition to hiding sensitive rules, recent researches also start discussing the reduction or avoidance of unexpected side effects, including the hiding of non-sensitive rules (lost rules) and the creation of non-existent rules (false rules). This thesis aims at a small amount of transaction modifications and proposes a method of rule hiding. The method can recover lost rules and keep sensitive rules hidden. Besides, we propose an efficient index structure for a quick retrieval of transactions during the hiding process. The experiments verify that our method can hide all sensitive rules and recover at most 40% lost rules. The index structure reduces about 85% retrieval time on average.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Kao, Tai-wei, and 高黛威. "Hiding dynamic sensitive association rules in incremental data." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/29229249691498416855.

Повний текст джерела
Анотація:
碩士
國立臺灣科技大學
資訊工程系
101
As the advancement of technologies as well as the intense competition of business, the issues of privacy have acquiring more attention. Mining association rule is the significant technique in data mining. However, it may cause some privacy problem in mining processes. Many researches, thus, start to hide sensitive association rules due to avoid the sensitive information exposed. However, the development of computers and Internet technologies is so fast that data are increasing successively. In addition, sensitive association rules will change with time and policy. These both are the challenges for protecting sensitive association rules. Most exist technologies of hiding sensitive association rules cannot handle dynamic data and sensitive rules effectively. For solving these problems, this paper proposed a framework to protect dynamic sensitive association rules in incremental environment, HSAi and HDSA. HSAi is the algorithm to protect sensitive association rule in incremental data and we design the strategy to select appropriate victim transactions and items to delete them in order to hide sensitive association rules. HDSA is the algorithm for protecting dynamic sensitive rules, including adding and deleting. The mean of the deleting sensitive rule is the association rule that hidden can show again in the mining result. The goals of HSAi and HDSA are not only protecting sensitive rules but also producing least side effect from released dataset. Experiment results represent that the framework situation of incremental data and dynamic sensitive rules both can cause least side effects and maintain a desirable quality of sanitized database as well.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Lai, Ting-Zheng, and 賴廷政. "A Study of Hiding Collaborative Recommendation Association Rules on Horizontally Partitioned Data." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/19596225694306918568.

Повний текст джерела
Анотація:
碩士
義守大學
資訊管理學系碩士班
98
The study of privacy preserving data mining has become more important in recent years due to the increasing amount of personal data in public, the increasing sophistication of data mining algorithms to leverage this information, and the increasing concern of privacy breaches. Association rule hiding in which some of the association rules are suppressed in order to preserve privacy has been identified as a practical privacy preserving application. Most current association rule hiding techniques assume that the data to be sanitized are in one single data set. However, in the real world, data may exist in distributed environment and owned by non-trusting parties that might be willing to collaborate. In this work, we propose a framework to hide collaborative recommendation association rules where the data sets are horizontally partitioned and owned by non-trusting parties. Algorithms to hide the collaborative recommendation association rules and to merge the sanitized data sets are introduced. Performance and various side effects of the proposed approach are analyzed numerically. Comparisons with trusting-third-party approach are reported. The proposed non-trusting-third-party approach shows better processing time, with similar side effects.
Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "RULE HIDING"

1

Gkoulalas-Divanis, Aris, and Vassilios S. Verykios. Association Rule Hiding for Data Mining. Boston, MA: Springer US, 2010. http://dx.doi.org/10.1007/978-1-4419-6569-1.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Gkoulalas-Divanis, Aris. Association rule hiding for data mining. New York: Springer, 2010.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Gkoulalas-Divanis, Aris, and Vassilios S. Verykios. Association Rule Hiding for Data Mining. Springer, 2012.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Wallace, Jeremy L. Seeking Truth and Hiding Facts. Oxford University PressNew York, 2022. http://dx.doi.org/10.1093/oso/9780197627655.001.0001.

Повний текст джерела
Анотація:
Abstract A few numbers came to define Chinese politics, until they did not count what mattered and what they counted did not measure up. Seeking Truth and Hiding Facts argues that the Chinese government adopted a system of limited, quantified vision in order to survive the disasters unleashed by Mao Zedong’s ideological leadership, explains how that system worked, and analyzes how problems accumulated in its blind spots leading Xi Jinping to take the regime into a neopolitical turn. Xi’s new normal is an attempt to fix the problems of the prior system, as well as a hedge against an inability to do so. The book argues that while of course dictators stay in power through coercion and co-optation, they also do so by convincing their populations and themselves of their right to rule. Quantification is one tool in this persuasive arsenal, but it comes with its own perils.
Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "RULE HIDING"

1

Gkoulalas-Divanis, Aris, and Vassilios S. Verykios. "Classes of Association Rule Hiding Methodologies." In Advances in Database Systems, 17–20. Boston, MA: Springer US, 2010. http://dx.doi.org/10.1007/978-1-4419-6569-1_3.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Sharmila, S., and S. Vijayarani. "Association Rule Hiding Using Firefly Optimization Algorithm." In Advances in Intelligent Systems and Computing, 699–708. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-16660-1_68.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Gopalan, N. P., and T. Satyanarayana Murthy. "Association Rule Hiding Using Chemical Reaction Optimization." In Advances in Intelligent Systems and Computing, 249–55. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-1592-3_19.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Mogtaba, Shyma, and Eiman Kambal. "Association Rule Hiding for Privacy Preserving Data Mining." In Advances in Data Mining. Applications and Theoretical Aspects, 320–33. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-41561-1_24.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Natwichai, Juggapong, Maria E. Orlowska, and Xingzhi Sun. "Hiding Sensitive Associative Classification Rule by Data Reduction." In Advanced Data Mining and Applications, 310–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-73871-8_29.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Katsarou, Aliki, Gkoulalas-Divanis Aris, and Vassilios S. Verykios. "Reconstruction-based Classification Rule Hiding through Controlled Data Modification." In IFIP Advances in Information and Communication Technology, 449–58. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4419-0221-4_53.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Verykios, Vassilios S., and Aris Gkoulalas-Divanis. "A Survey of Association Rule Hiding Methods for Privacy." In Privacy-Preserving Data Mining, 267–89. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-70992-5_11.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Yampolskiy, Roman V., Jovan D. Rebolledo-Mendez, and Musa M. Hindi. "Password Protected Visual Cryptography via Cellular Automaton Rule 30." In Transactions on Data Hiding and Multimedia Security IX, 57–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-55046-1_4.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Natwichai, Juggapong, Xingzhi Sun, and Xue Li. "A Heuristic Data Reduction Approach for Associative Classification Rule Hiding." In PRICAI 2008: Trends in Artificial Intelligence, 140–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89197-0_16.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Cheng, Peng, Shu-Chuan Chu, Chun-Wei Lin, and John F. Roddick. "Distortion-Based Heuristic Sensitive Rule Hiding Method – The Greedy Way." In Modern Advances in Applied Intelligence, 77–86. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07455-9_9.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "RULE HIDING"

1

Zhu, Zutao, and Wenliang Du. "K-anonymous association rule hiding." In the 5th ACM Symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1755688.1755726.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Fovino, Igor Nai, and Alberto Trombetta. "Information driven association rule hiding algorithms." In 2008 1st International Conference on Information Technology (IT 2008). IEEE, 2008. http://dx.doi.org/10.1109/inftech.2008.4621664.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Jinturkar, R. S., and S. Kolkur. "Measuring side effects of rule hiding." In the International Conference & Workshop. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1980022.1980128.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Jinturkar, S. Rahul, and Seema Kolkur. "Measuring side effects of rule hiding." In the International Conference & Workshop. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1980022.1980382.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Zhang, Xiaoming, and Xi Qiao. "New Approach for Sensitive Association Rule Hiding." In 2008 International Workshop on Geoscience and Remote Sensing (ETT and GRS). IEEE, 2008. http://dx.doi.org/10.1109/ettandgrs.2008.379.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Garg, Vikram, Anju Singh, and Divakar Singh. "A Survey of Association Rule Hiding Algorithms." In 2014 International Conference on Communication Systems and Network Technologies (CSNT). IEEE, 2014. http://dx.doi.org/10.1109/csnt.2014.86.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Cheng, Peng. "Identify Risky Rules to Reduce Side Effects in Association Rule Hiding." In CIKM '23: The 32nd ACM International Conference on Information and Knowledge Management. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3583780.3615259.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Femandes, Melissa, and Joanne Gomes. "Heuristic approach for association rule hiding using ECLAT." In 2017 2nd International Conference on Communication Systems, Computing and IT Applications (CSCITA). IEEE, 2017. http://dx.doi.org/10.1109/cscita.2017.8066557.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Doan, Khue, Minh Nguyen Quang, and Bac Le. "Applied Cuckoo Algorithm for Association Rule Hiding Problem." In SoICT 2017: The Eighth International Symposium on Information and Communication Technology. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3155133.3155150.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Wette, Philip, and Holger Karl. "Which flows are hiding behind my wildcard rule?" In SIGCOMM'13: ACM SIGCOMM 2013 Conference. New York, NY, USA: ACM, 2013. http://dx.doi.org/10.1145/2486001.2491710.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "RULE HIDING"

1

Megersa, Kelbesa. Tax Transparency for an Effective Tax System. Institute of Development Studies (IDS), January 2021. http://dx.doi.org/10.19088/k4d.2021.070.

Повний текст джерела
Анотація:
This rapid review examines evidence on the transparency in the tax system and its benefits; e.g. rising revenue, strengthen citizen/state relationship, and rule of law. Improvements in tax transparency can help in strengthening public finances in developing countries that are adversely affected by COVID-19. The current context (i.e. a global pandemic, widespread economic slowdown/recessions, and declining tax revenues) engenders the urgency of improving domestic resource mobilisation (DRM) and the fight against illicit financial flows (IFFs). Even before the advent of COVID-19, developing countries’ tax systems were facing several challenges, including weak tax administrations, low taxpayer morale and “hard-to-tax” sectors. The presence of informational asymmetry (i.e. low tax transparency) between taxpayers and tax authorities generates loopholes for abuse of the tax system. It allows the hiding of wealth abroad with a limited risk of being caught. Cases of such behaviour that are exposed without proper penalty may result in a decline in the morale of citizens and a lower level of voluntary compliance with tax legislation. A number of high-profile tax leaks and scandals have undermined public confidence in the fairness of tax systems and generated a strong demand for effective counteraction and tax transparency. One of the key contributing factors to lower tax revenues in developing countries (that is linked to low tax transparency) is a high level of IFFs. These flows, including international tax evasion and the laundering of corruption proceeds, build a major obstacle to successful DRM efforts. Research has also identified an association between organisational transparency (e.g. transparency by businesses and tax authorities) and stakeholder trust (e.g. between citizens and the state). However, the evidence is mixed as to how transparency in particular influences trust and perceptions of trustworthiness.
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "RULE HIDING" для конкретних типів джерел:
Статті в журналах
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії