Bibliographies thématiques / MINING ASSOCIATION RULES

Littérature scientifique sur le sujet « MINING ASSOCIATION RULES »

Auteur : Grafiati

Publié le 11 septembre 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Articles de revues
Thèses
Livres
Chapitres de livres
Actes de conférences

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « MINING ASSOCIATION RULES ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "MINING ASSOCIATION RULES"

Pandey, Sachin. « Multilevel Association Rules in Data Mining ». Journal of Advances and Scholarly Researches in Allied Education 15, n^o 5 (1 juillet 2018) : 74–78. http://dx.doi.org/10.29070/15/57517.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Lu, Songfeng, Heping Hu et Fan Li. « Mining weighted association rules ». Intelligent Data Analysis 5, n^o 3 (1 mai 2001) : 211–25. http://dx.doi.org/10.3233/ida-2001-5303.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Defit, Sarjon. « Intelligent Mining Association Rules ». International Journal of Computer Science and Information Technology 4, n^o 4 (31 août 2012) : 97–106. http://dx.doi.org/10.5121/ijcsit.2012.4409.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Srikant, Ramakrishnan, et Rakesh Agrawal. « Mining generalized association rules ». Future Generation Computer Systems 13, n^o 2-3 (novembre 1997) : 161–80. http://dx.doi.org/10.1016/s0167-739x(97)00019-8.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Mani, Tushar. « Mining Negative Association Rules ». IOSR Journal of Computer Engineering 3, n^o 6 (2012) : 43–47. http://dx.doi.org/10.9790/0661-0364347.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Kanimozhi Selvi, C. S., et A. Tamilarasi. « Mining Association rules with Dynamic and Collective Support Thresholds ». International Journal of Engineering and Technology 1, n^o 3 (2009) : 236–40. http://dx.doi.org/10.7763/ijet.2009.v1.44.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Ali, Nzar Abdulqader. « Finding minimum confidence threshold to avoid derived rules in association rule minin ». Journal of Zankoy Sulaimani - Part A 17, n^o 4 (30 août 2015) : 271–78. http://dx.doi.org/10.17656/jzs.10443.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Tan, Jun, et Ying Yong Bu. « Association Rules Mining in Manufacturing ». Applied Mechanics and Materials 34-35 (octobre 2010) : 651–54. http://dx.doi.org/10.4028/www.scientific.net/amm.34-35.651.

Texte intégral

Résumé :

In recent years, manufacturing processes have become more and more complex, manufacturing activities generate large quantities of data, so it is no longer practical to rely on traditional manual methods to analyze this data. Data mining offers tools for extracting knowledge from data, leading to significant improvement in the decision-making process. Association rules mining is one of the most important data mining techniques and has received considerable attention from researchers and practitioners. The paper presents the basic concept of association rule mining and reviews applications of association rules in manufacturing, including product design, manufacturing, process, customer relationship management, supply chain management, and product quality improvement. This paper is focused on demonstrating the relevancy of association rules mining to manufacturing industry, rather than discussing the association rules mining domain in general.

Styles APA, Harvard, Vancouver, ISO, etc.

Kazienko, Przemysław. « Mining Indirect Association Rules for Web Recommendation ». International Journal of Applied Mathematics and Computer Science 19, n^o 1 (1 mars 2009) : 165–86. http://dx.doi.org/10.2478/v10006-009-0015-5.

Texte intégral

Résumé :

Mining Indirect Association Rules for Web RecommendationClassical association rules, here called "direct", reflect relationships existing between items that relatively often co-occur in common transactions. In the web domain, items correspond to pages and transactions to user sessions. The main idea of the new approach presented is to discover indirect associations existing between pages that rarely occur together but there are other, "third" pages, called transitive, with which they appear relatively frequently. Two types of indirect associations rules are described in the paper: partial indirect associations and complete ones. The former respect single transitive pages, while the latter cover all existing transitive pages. The presented IDARM* Algorithm extracts complete indirect association rules with their important measure—confidence—using pre-calculated direct rules. Both direct and indirect rules are joined into one set of complex association rules, which may be used for the recommendation of web pages. Performed experiments revealed the usefulness of indirect rules for the extension of a typical recommendation list. They also deliver new knowledge not available to direct ones. The relation between ranking lists created on the basis of direct association rules as well as hyperlinks existing on web pages is also examined.

Styles APA, Harvard, Vancouver, ISO, etc.

Han, Jianchao, et Mohsen Beheshti. « Discovering Both Positive and Negative Fuzzy Association Rules in Large Transaction Databases ». Journal of Advanced Computational Intelligence and Intelligent Informatics 10, n^o 3 (20 mai 2006) : 287–94. http://dx.doi.org/10.20965/jaciii.2006.p0287.

Texte intégral

Résumé :

Mining association rules is an important task of dara mining and knowledge discovery. Traditional association rules mining is built on transaction databases, which has some limitations. Two of these limitations are 1) each transaction merely contains binary items, meaning that an item either occurs in a transaction or not; 2) only positive association rules are discovered, while negative associations are ignored. Mining fuzzy association rules has been proposed to address the first limitation, while mining algorithms for negative association rules have been developed to resolve the second limitation. In this paper, we combine these two approaches to propose a novel approach for mining both positive and negative fuzzy association rules. The interestingness measure for both positive and negative fuzzy association rule is proposed, the algorithm for mining these rules is described, and an illustrative example is presented to demonstrate how the measure and the algorithm work.

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Thèses sur le sujet "MINING ASSOCIATION RULES"

Cai, Chun Hing. « Mining association rules with weighted items ». Hong Kong : Chinese University of Hong Kong, 1998. http://www.cse.cuhk.edu.hk/%7Ekdd/assoc%5Frule/thesis%5Fchcai.pdf.

Texte intégral

Résumé :

Thesis (M. Phil.)--Chinese University of Hong Kong, 1998.
Description based on contents viewed Mar. 13, 2007; title from title screen. Includes bibliographical references (p. 99-103). Also available in print.

Styles APA, Harvard, Vancouver, ISO, etc.

Zhou, Zequn. « Maintaining incremental data mining association rules ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/MQ62311.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Goulbourne, Graham. « Tree algorithms for mining association rules ». Thesis, University of Liverpool, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.250218.

Texte intégral

Résumé :

With the increasing reliability of digital communication, the falling cost of hardware and increased computational power, the gathering and storage of data has become easier than at any other time in history. Commercial and public agencies are able to hold extensive records about all aspects of their operations. Witness the proliferation of point of sale (POS) transaction recording within retailing, digital storage of census data and computerized hospital records. Whilst the gathering of such data has uses in terms of answering specific queries and allowing visulisation of certain trends the volumes of data can hide significant patterns that would be impossible to locate manually. These patterns, once found, could provide an insight into customer behviour, demographic shifts and patient diagnosis hitherto unseen and unexpected. Remaining competitive in a modem business environment, or delivering services in a timely and cost effective manner for public services is a crucial part of modem economics. Analysis of the data held by an organisaton, by a system that "learns" can allow predictions to be made based on historical evidence. Users may guide the process but essentially the software is exploring the data unaided. The research described within this thesis develops current ideas regarding the exploration of large data volumes. Particular areas of research are the reduction of the search space within the dataset and the generation of rules which are deduced from the patterns within the data. These issues are discussed within an experimental framework which extracts information from binary data.

Styles APA, Harvard, Vancouver, ISO, etc.

Koh, Yun Sing, et n/a. « Generating sporadic association rules ». University of Otago. Department of Computer Science, 2007. http://adt.otago.ac.nz./public/adt-NZDU20070711.115758.

Texte intégral

Résumé :

Association rule mining is an essential part of data mining, which tries to discover associations, relationships, or correlations among sets of items. As it was initially proposed for market basket analysis, most of the previous research focuses on generating frequent patterns. This thesis focuses on finding infrequent patterns, which we call sporadic rules. They represent rare itemsets that are scattered sporadically throughout the database but with high confidence of occurring together. As sporadic rules have low support the minabssup (minimum absolute support) measure was proposed to filter out any rules with low support whose occurrence is indistinguishable from that of coincidence. There are two classes of sporadic rules: perfectly sporadic and imperfectly sporadic rules. Apriori-Inverse was then proposed for perfectly sporadic rule generation. It uses a maximum support threshold and user-defined minimum confidence threshold. This method is designed to find itemsets which consist only of items falling below a maximum support threshold. However imperfectly sporadic rules may contain items with a frequency of occurrence over the maximum support threshold. To look for these rules, variations of Apriori-Inverse, namely Fixed Threshold, Adaptive Threshold, and Hill Climbing, were proposed. However these extensions are heuristic. Thus the MIISR algorithm was proposed to find imperfectly sporadic rules using item constraints, which capture rules with a single-item consequent below the maximum support threshold. A comprehensive evaluation of sporadic rules and current interestingness measures was carried out. Our investigation suggests that current interestingness measures are not suitable for detecting sporadic rules.

Styles APA, Harvard, Vancouver, ISO, etc.

Pray, Keith A. « Apriori Sets And Sequences : Mining Association Rules from Time Sequence Attributes ». Link to electronic thesis, 2004. http://www.wpi.edu/Pubs/ETD/Available/etd-0506104-150831/.

Texte intégral

Résumé :

Thesis (M.S.) -- Worcester Polytechnic Institute.
Keywords: mining complex data; temporal association rules; computer system performance; stock market analysis; sleep disorder data. Includes bibliographical references (p. 79-85).

Styles APA, Harvard, Vancouver, ISO, etc.

王漣 et Lian Wang. « A study on quantitative association rules ». Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31223588.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Wang, Lian. « A study on quantitative association rules / ». Hong Kong : University of Hong Kong, 1999. http://sunzi.lib.hku.hk/hkuto/record.jsp?B2118561X.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Zhu, Hua. « On-line analytical mining of association rules ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ37678.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Wu, Jingtong. « Interpretation of association rules with multi-tier granule mining ». Thesis, Queensland University of Technology, 2014. https://eprints.qut.edu.au/71455/1/Jing_Wu_Thesis.pdf.

Texte intégral

Résumé :

This study was a step forward to improve the performance for discovering useful knowledge – especially, association rules in this study – in databases. The thesis proposed an approach to use granules instead of patterns to represent knowledge implicitly contained in relational databases; and multi-tier structure to interpret association rules in terms of granules. Association mappings were proposed for the construction of multi-tier structure. With these tools, association rules can be quickly assessed and meaningless association rules can be justified according to the association mappings. The experimental results indicated that the proposed approach is promising.

Styles APA, Harvard, Vancouver, ISO, etc.

Delpisheh, Elnaz, et University of Lethbridge Faculty of Arts and Science. « Two new approaches to evaluate association rules ». Thesis, Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2010, 2010. http://hdl.handle.net/10133/2530.

Texte intégral

Résumé :

Data mining aims to discover interesting and unknown patterns in large-volume data. Association rule mining is one of the major data mining tasks, which attempts to find inherent relationships among data items in an application domain, such as supermarket basket analysis. An essential post-process in an association rule mining task is the evaluation of association rules by measures for their interestingness. Different interestingness measures have been proposed and studied. Given an association rule mining task, measures are assessed against a set of user-specified properties. However, in practice, given the subjectivity and inconsistencies in property specifications, it is a non-trivial task to make appropriate measure selections. In this work, we propose two novel approaches to assess interestingness measures. Our first approach utilizes the analytic hierarchy process to capture quantitatively domain-dependent requirements on properties, which are later used in assessing measures. This approach not only eliminates any inconsistencies in an end user’s property specifications through consistency checking but also is invariant to the number of association rules. Our second approach dynamically evaluates association rules according to a composite and collective effect of multiple measures. It interactively snapshots the end user’s domain- dependent requirements in evaluating association rules. In essence, our approach uses neural networks along with back-propagation learning to capture the relative importance of measures in evaluating association rules. Case studies and simulations have been conducted to show the effectiveness of our two approaches.
viii, 85 leaves : ill. ; 29 cm

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Livres sur le sujet "MINING ASSOCIATION RULES"

Kaninis, A. Concurrent Mining of Association Rules. Manchester : UMIST, 1997.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Dass, Rajanish. Classification using association rules. Ahmedabad : Indian Institute of Management, 2008.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Adamo, Jean-Marc. Data Mining for Association Rules and Sequential Patterns. New York, NY : Springer New York, 2001. http://dx.doi.org/10.1007/978-1-4613-0085-4.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

1977-, Zhao Yanchang, Zhang Chengqi 1957- et Cao Longbing 1969-, dir. Post-mining of association rules : Techniques for effective knowledge extraction. Hershey, PA : Information Science Reference, 2009.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Data Mining for Association Rules and Sequential Patterns : Sequential and Parallel Algorithms. New York, NY : Springer New York, 2001.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Zhang, Chengqi, et Shichao Zhang, dir. Association Rule Mining. Berlin, Heidelberg : Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-46027-6.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Gkoulalas-Divanis, Aris, et 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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Kazienko, Przemysław. Associations : Discovery, analysis and applications. Wrocław : Oficyna Wydawnicza Politechniki Wrocławskiej, 2008.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

1978-, Koh Yun Sing, et Rountree Nathan 1974-, dir. Rare association rule mining and knowledge discovery : Technologies for infrequent and critical event detection. Hershey, PA : Information Science Reference, 2010.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Chapitres de livres sur le sujet "MINING ASSOCIATION RULES"

Atkinson-Abutridy, John. « Association Rules Mining ». Dans Text Analytics, 91–104. Boca Raton : Chapman and Hall/CRC, 2022. http://dx.doi.org/10.1201/9781003280996-5.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Antonie, Luiza, Jundong Li et Osmar Zaiane. « Negative Association Rules ». Dans Frequent Pattern Mining, 135–45. Cham : Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07821-2_6.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Höppner, Frank. « Association Rules ». Dans Data Mining and Knowledge Discovery Handbook, 299–319. Boston, MA : Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-09823-4_15.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Ventura, Sebastián, et José María Luna. « Class Association Rules ». Dans Supervised Descriptive Pattern Mining, 99–128. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-98140-6_5.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Zhang, Tao. « Association Rules ». Dans Knowledge Discovery and Data Mining. Current Issues and New Applications, 245–56. Berlin, Heidelberg : Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45571-x_31.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Triantaphyllou, Evangelos. « Mining of Association Rules ». Dans Data Mining and Knowledge Discovery via Logic-Based Methods, 241–55. Boston, MA : Springer US, 2010. http://dx.doi.org/10.1007/978-1-4419-1630-3_12.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Bembenik, Robert, et Grzegorz Protaziuk. « Mining Spatial Association Rules ». Dans Intelligent Information Processing and Web Mining, 3–12. Berlin, Heidelberg : Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-39985-8_1.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Hamano, Shinichi, et Masako Sato. « Mining Indirect Association Rules ». Dans Advances in Data Mining, 106–16. Berlin, Heidelberg : Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30185-1_12.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Liu, Bing. « Association Rules and Sequential Patterns ». Dans Web Data Mining, 17–62. Berlin, Heidelberg : Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19460-3_2.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Dehaspe, Luc, et Hannu Toivonen. « Discovery of Relational Association Rules ». Dans Relational Data Mining, 189–212. Berlin, Heidelberg : Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-04599-2_8.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "MINING ASSOCIATION RULES"

Li, Jiuyong, Thuc Duy Le, Lin Liu, Jixue Liu, Zhou Jin et Bingyu Sun. « Mining Causal Association Rules ». Dans 2013 IEEE 13th International Conference on Data Mining Workshops (ICDMW). IEEE, 2013. http://dx.doi.org/10.1109/icdmw.2013.88.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chan, Keith C. C., et Wai-Ho Au. « Mining fuzzy association rules ». Dans the sixth international conference. New York, New York, USA : ACM Press, 1997. http://dx.doi.org/10.1145/266714.266898.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Lee, Yue-Shi, et Show-Jane Yen. « Mining Utility Association Rules ». Dans ICCAE 2018 : 2018 10th International Conference on Computer and Automation Engineering. New York, NY, USA : ACM, 2018. http://dx.doi.org/10.1145/3192975.3192987.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Selmane, Sid Ali, Rokia Missaoui, Omar Boussaid et Fadila Bentayeb. « Mining Triadic Association Rules ». Dans Second International Conference on Advanced Information Technologies and Applications. Academy & Industry Research Collaboration Center (AIRCC), 2013. http://dx.doi.org/10.5121/csit.2013.3825.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Jabas, Ahmad, Rama M. Garimella et S. Ramachandram. « MANET mining : Mining step association rules ». Dans 2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS). IEEE, 2008. http://dx.doi.org/10.1109/mahss.2008.4660089.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Jabas, Ahmad, Rama Murtty Garimella et Sirandas Ramachandram. « MANET Mining : Mining Temporal Association Rules ». Dans 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications. IEEE, 2008. http://dx.doi.org/10.1109/ispa.2008.66.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Ras, Zbigniew W., Agnieszka Dardzinska, Li-Shiang Tsay et Hanna Wasyluk. « Association Action Rules ». Dans 2008 IEEE International Conference on Data Mining Workshops (ICDMW). IEEE, 2008. http://dx.doi.org/10.1109/icdmw.2008.66.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nahm, Un Yong, et Raymond J. Mooney. « Mining soft-matching association rules ». Dans the eleventh international conference. New York, New York, USA : ACM Press, 2002. http://dx.doi.org/10.1145/584792.584918.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Olson, David L., et Yanhong Li. « Mining Fuzzy Weighted Association Rules ». Dans Proceedings of the 40th Annual Hawaii International Conference on System Sciences. IEEE, 2007. http://dx.doi.org/10.1109/hicss.2007.341.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Goethals, Bart, Juho Muhonen et Hannu Toivonen. « Mining Non-Derivable Association Rules ». Dans Proceedings of the 2005 SIAM International Conference on Data Mining. Philadelphia, PA : Society for Industrial and Applied Mathematics, 2005. http://dx.doi.org/10.1137/1.9781611972757.22.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!