Relevant bibliographies by topics / Association rules mining

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Association rules mining'

Author: Grafiati
Published: 4 June 2021
Last updated: 9 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Association rules mining.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Association rules mining"

1

Pandey, Sachin. "Multilevel Association Rules in Data Mining." Journal of Advances and Scholarly Researches in Allied Education 15, no. 5 (July 1, 2018): 74–78. http://dx.doi.org/10.29070/15/57517.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Prakash, R. Vijaya, S. S. V. N. Sarma, and M. Sheshikala. "Generating Non-redundant Multilevel Association Rules Using Min-max Exact Rules." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 6 (December 1, 2018): 4568–76. https://doi.org/10.11591/ijece.v8i6.pp4568-4576.

Full text
Abstract:
Association Rule mining plays an important role in the discovery of knowledge and information. Association Rule mining discovers huge number of rules for any dataset for different support and confidence values, among this many of them are redundant, especially in the case of multi-level datasets. Mining non-redundant Association Rules in multi-level dataset is a big concern in field of Data mining. In this paper, we present a definition for redundancy and a concise representation called Reliable Exact basis for representing non-redundant Association Rules from multi-level datasets. The given non-redundant Association Rules are loss less representation for any datasets.
APA, Harvard, Vancouver, ISO, and other styles
3

Lu, Songfeng, Heping Hu, and Fan Li. "Mining weighted association rules." Intelligent Data Analysis 5, no. 3 (May 1, 2001): 211–25. http://dx.doi.org/10.3233/ida-2001-5303.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Defit, Sarjon. "Intelligent Mining Association Rules." International Journal of Computer Science and Information Technology 4, no. 4 (August 31, 2012): 97–106. http://dx.doi.org/10.5121/ijcsit.2012.4409.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Srikant, Ramakrishnan, and Rakesh Agrawal. "Mining generalized association rules." Future Generation Computer Systems 13, no. 2-3 (November 1997): 161–80. http://dx.doi.org/10.1016/s0167-739x(97)00019-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
9

Thomas, Binu, and G. Raju. "A Novel Web Classification Algorithm Using Fuzzy Weighted Association Rules." ISRN Artificial Intelligence 2013 (December 19, 2013): 1–10. http://dx.doi.org/10.1155/2013/316913.

Full text
Abstract:
In associative classification method, the rules generated from association rule mining are converted into classification rules. The concept of association rule mining can be extended in web mining environment to find associations between web pages visited together by the internet users in their browsing sessions. The weighted fuzzy association rule mining techniques are capable of finding natural associations between items by considering the significance of their presence in a transaction. The significance of an item in a transaction is usually referred as the weight of an item in the transaction and finding associations between such weighted items is called fuzzy weighted association rule mining. In this paper, we are presenting a novel web classification algorithm using the principles of fuzzy association rule mining to classify the web pages into different web categories, depending on the manner in which they appear in user sessions. The results are finally represented in the form of classification rules and these rules are compared with the result generated using famous Boolean Apriori association rule mining algorithm.
APA, Harvard, Vancouver, ISO, and other styles
10

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Association rules mining"

1

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.

Full text
Abstract:
Thesis (M. Phil.)--Chinese University of Hong Kong, 1998.<br>Description based on contents viewed Mar. 13, 2007; title from title screen. Includes bibliographical references (p. 99-103). Also available in print.
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
5

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/.

Full text
Abstract:
Thesis (M.S.) -- Worcester Polytechnic Institute.<br>Keywords: mining complex data; temporal association rules; computer system performance; stock market analysis; sleep disorder data. Includes bibliographical references (p. 79-85).
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
10

Delpisheh, Elnaz, and 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.

Full text
Abstract:
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.<br>viii, 85 leaves : ill. ; 29 cm
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Association rules mining"

1

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Adamo, Jean-Marc. Data Mining for Association Rules and Sequential Patterns. Island Press, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Association rules mining"

1

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Höppner, Frank. "Association Rules." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zhang, Tao. "Association Rules." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Triantaphyllou, Evangelos. "Mining of Association Rules." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bembenik, Robert, and Grzegorz Protaziuk. "Mining Spatial Association Rules." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Amolochitis, Emmanouil. "Quantitative Association Rules Mining." In Algorithms and Applications for Academic Search, Recommendation and Quantitative Association Rule Mining, 77–100. New York: River Publishers, 2022. http://dx.doi.org/10.1201/9781003337140-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yen, Show-Jane, Yue-Shi Lee, and Wen-Hao Lee. "Mining Quantitative Association Rules." In Lecture Notes in Computer Science, 373–84. Singapore: Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-0695-5_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Association rules mining"

1

Kovalchuk, Olha, Serhiy Banakh, Mariia Masonkova, Andrii Kolesnikov, Pavlo Chopyk, and Pavlo Basistyi. "Association Rules Mining in Crime Data Analysis." In 2024 14th International Conference on Advanced Computer Information Technologies (ACIT), 144–49. IEEE, 2024. http://dx.doi.org/10.1109/acit62333.2024.10712467.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kudriavtsev, Mikhail, Andrew McCarren, Hyowon Lee, and Marija Bezbradica. "Efficient Visualization of Association Rule Mining Using the Trie of Rules." In 16th International Conference on Knowledge Discovery and Information Retrieval, 72–80. SCITEPRESS - Science and Technology Publications, 2024. http://dx.doi.org/10.5220/0012995500003838.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lee, Yue-Shi, and Show-Jane Yen. "Mining Utility Association Rules." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Selmane, Sid Ali, Rokia Missaoui, Omar Boussaid, and Fadila Bentayeb. "Mining Triadic Association Rules." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Association rules mining' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography