Mining Association Rules: Deriving a Superior Algorithm by Analyzing Today’s Approaches View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2000

AUTHORS

Jochen Hipp , Ulrich Güntzer , Gholamreza Nakhaeizadeh

ABSTRACT

Since the introduction of association rules, many algorithms have been developed to perform the computationally very intensive task of association rule mining. During recent years there has been the tendency in research to concentrate on developing algorithms for specialized tasks, e.g. for mining optimized rules or incrementally updating rule sets. Here we return to the “classic” problem, namely the efficient generation of all association rules that exist in a given set of transactions with respect to minimum support and minimum confidence. From our point of view, the performance problem concerning this task is still not adequately solved. In this paper we address two topics: First of all, today there is no satisfying comparison of the common algorithms. Therefore we identify the fundamental strategies of association rule mining and present a general framework that is independent of any particular approach and its implementation. Based on this we carefully analyze the algorithms. We explain differences and similarities in performance behavior and complete our theoretic insights by runtime experiments. Second, the results are quite surprising and enable us to derive a new algorithm. This approach avoids the identified pitfalls and at the same time profits from the strengths of known approaches. It turns out that it achieves remarkably better runtimes than the previous algorithms. More... »

PAGES

159-168

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-45372-5_16

DOI

http://dx.doi.org/10.1007/3-540-45372-5_16

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1007312554


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Wilhelm Schickard-Institute, University of T\u00fcbingen, 72076, T\u00fcbingen, Germany", 
          "id": "http://www.grid.ac/institutes/grid.10392.39", 
          "name": [
            "Wilhelm Schickard-Institute, University of T\u00fcbingen, 72076, T\u00fcbingen, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Hipp", 
        "givenName": "Jochen", 
        "id": "sg:person.014732763563.11", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014732763563.11"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Wilhelm Schickard-Institute, University of T\u00fcbingen, 72076, T\u00fcbingen, Germany", 
          "id": "http://www.grid.ac/institutes/grid.10392.39", 
          "name": [
            "Wilhelm Schickard-Institute, University of T\u00fcbingen, 72076, T\u00fcbingen, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "G\u00fcntzer", 
        "givenName": "Ulrich", 
        "id": "sg:person.013324511711.75", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013324511711.75"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "DaimlerChrysler AG, Research & Technology FT3/AD, 89081, Ulm, Germany", 
          "id": "http://www.grid.ac/institutes/grid.5433.1", 
          "name": [
            "DaimlerChrysler AG, Research & Technology FT3/AD, 89081, Ulm, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Nakhaeizadeh", 
        "givenName": "Gholamreza", 
        "id": "sg:person.07467643565.95", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07467643565.95"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2000", 
    "datePublishedReg": "2000-01-01", 
    "description": "Since the introduction of association rules, many algorithms have been developed to perform the computationally very intensive task of association rule mining. During recent years there has been the tendency in research to concentrate on developing algorithms for specialized tasks, e.g. for mining optimized rules or incrementally updating rule sets. Here we return to the \u201cclassic\u201d problem, namely the efficient generation of all association rules that exist in a given set of transactions with respect to minimum support and minimum confidence. From our point of view, the performance problem concerning this task is still not adequately solved. In this paper we address two topics: First of all, today there is no satisfying comparison of the common algorithms. Therefore we identify the fundamental strategies of association rule mining and present a general framework that is independent of any particular approach and its implementation. Based on this we carefully analyze the algorithms. We explain differences and similarities in performance behavior and complete our theoretic insights by runtime experiments. Second, the results are quite surprising and enable us to derive a new algorithm. This approach avoids the identified pitfalls and at the same time profits from the strengths of known approaches. It turns out that it achieves remarkably better runtimes than the previous algorithms.", 
    "editor": [
      {
        "familyName": "Zighed", 
        "givenName": "Djamel A.", 
        "type": "Person"
      }, 
      {
        "familyName": "Komorowski", 
        "givenName": "Jan", 
        "type": "Person"
      }, 
      {
        "familyName": "\u017bytkow", 
        "givenName": "Jan", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-45372-5_16", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-41066-9", 
        "978-3-540-45372-7"
      ], 
      "name": "Principles of Data Mining and Knowledge Discovery", 
      "type": "Book"
    }, 
    "keywords": [
      "association rule mining", 
      "rule mining", 
      "association rules", 
      "set of transactions", 
      "intensive tasks", 
      "minimum support", 
      "minimum confidence", 
      "Runtime experiments", 
      "rule sets", 
      "better runtime", 
      "previous algorithms", 
      "superior algorithm", 
      "common algorithms", 
      "performance problems", 
      "new algorithm", 
      "algorithm", 
      "same time profit", 
      "today's approaches", 
      "mining", 
      "specialized tasks", 
      "performance behavior", 
      "general framework", 
      "task", 
      "theoretic insights", 
      "rules", 
      "particular approach", 
      "runtime", 
      "set", 
      "recent years", 
      "transactions", 
      "implementation", 
      "point of view", 
      "time profit", 
      "efficient generation", 
      "framework", 
      "fundamental strategy", 
      "topic", 
      "today", 
      "support", 
      "experiments", 
      "view", 
      "generation", 
      "similarity", 
      "profit", 
      "research", 
      "confidence", 
      "point", 
      "strategies", 
      "results", 
      "respect", 
      "pitfalls", 
      "introduction", 
      "comparison", 
      "behavior", 
      "insights", 
      "years", 
      "strength", 
      "tendency", 
      "differences", 
      "approach", 
      "problem", 
      "paper", 
      "Analyzing Today\u2019s Approaches"
    ], 
    "name": "Mining Association Rules: Deriving a Superior Algorithm by Analyzing Today\u2019s Approaches", 
    "pagination": "159-168", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1007312554"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-45372-5_16"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-45372-5_16", 
      "https://app.dimensions.ai/details/publication/pub.1007312554"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:28", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_94.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-45372-5_16"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/3-540-45372-5_16'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/3-540-45372-5_16'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-45372-5_16'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-45372-5_16'


 

This table displays all metadata directly associated to this object as RDF triples.

150 TRIPLES      23 PREDICATES      89 URIs      82 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-45372-5_16 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N1187ad4f76504b5a81c476564bc19e96
4 schema:datePublished 2000
5 schema:datePublishedReg 2000-01-01
6 schema:description Since the introduction of association rules, many algorithms have been developed to perform the computationally very intensive task of association rule mining. During recent years there has been the tendency in research to concentrate on developing algorithms for specialized tasks, e.g. for mining optimized rules or incrementally updating rule sets. Here we return to the “classic” problem, namely the efficient generation of all association rules that exist in a given set of transactions with respect to minimum support and minimum confidence. From our point of view, the performance problem concerning this task is still not adequately solved. In this paper we address two topics: First of all, today there is no satisfying comparison of the common algorithms. Therefore we identify the fundamental strategies of association rule mining and present a general framework that is independent of any particular approach and its implementation. Based on this we carefully analyze the algorithms. We explain differences and similarities in performance behavior and complete our theoretic insights by runtime experiments. Second, the results are quite surprising and enable us to derive a new algorithm. This approach avoids the identified pitfalls and at the same time profits from the strengths of known approaches. It turns out that it achieves remarkably better runtimes than the previous algorithms.
7 schema:editor N4e012a5db89e464f87da49b74c2622e3
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf Nba3df498feb3486788661b23e328b969
12 schema:keywords Analyzing Today’s Approaches
13 Runtime experiments
14 algorithm
15 approach
16 association rule mining
17 association rules
18 behavior
19 better runtime
20 common algorithms
21 comparison
22 confidence
23 differences
24 efficient generation
25 experiments
26 framework
27 fundamental strategy
28 general framework
29 generation
30 implementation
31 insights
32 intensive tasks
33 introduction
34 minimum confidence
35 minimum support
36 mining
37 new algorithm
38 paper
39 particular approach
40 performance behavior
41 performance problems
42 pitfalls
43 point
44 point of view
45 previous algorithms
46 problem
47 profit
48 recent years
49 research
50 respect
51 results
52 rule mining
53 rule sets
54 rules
55 runtime
56 same time profit
57 set
58 set of transactions
59 similarity
60 specialized tasks
61 strategies
62 strength
63 superior algorithm
64 support
65 task
66 tendency
67 theoretic insights
68 time profit
69 today
70 today's approaches
71 topic
72 transactions
73 view
74 years
75 schema:name Mining Association Rules: Deriving a Superior Algorithm by Analyzing Today’s Approaches
76 schema:pagination 159-168
77 schema:productId N31f94be82e56437599d094fe74b24051
78 N489c3585d4da4c6aa4519f73433a8956
79 schema:publisher Ncd4accfeb4b24775a77828959ee0d219
80 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007312554
81 https://doi.org/10.1007/3-540-45372-5_16
82 schema:sdDatePublished 2022-01-01T19:28
83 schema:sdLicense https://scigraph.springernature.com/explorer/license/
84 schema:sdPublisher N83fdca798d3045fc97f05fd8ecf8653f
85 schema:url https://doi.org/10.1007/3-540-45372-5_16
86 sgo:license sg:explorer/license/
87 sgo:sdDataset chapters
88 rdf:type schema:Chapter
89 N1187ad4f76504b5a81c476564bc19e96 rdf:first sg:person.014732763563.11
90 rdf:rest N464ae5f3c78a47c3bccbfe6c9e02fea4
91 N1b424f653e7746b1ac1930271bcc6d25 rdf:first sg:person.07467643565.95
92 rdf:rest rdf:nil
93 N31f94be82e56437599d094fe74b24051 schema:name dimensions_id
94 schema:value pub.1007312554
95 rdf:type schema:PropertyValue
96 N464ae5f3c78a47c3bccbfe6c9e02fea4 rdf:first sg:person.013324511711.75
97 rdf:rest N1b424f653e7746b1ac1930271bcc6d25
98 N489c3585d4da4c6aa4519f73433a8956 schema:name doi
99 schema:value 10.1007/3-540-45372-5_16
100 rdf:type schema:PropertyValue
101 N4e012a5db89e464f87da49b74c2622e3 rdf:first N7baef38b47814fb2956dbfd3394aa22f
102 rdf:rest Na58097ccb7cb4ea792f7eabf22d613f4
103 N732486e74e8945efa4fb492caeb5f2a2 rdf:first Ne36506f54c3643038076a8c7d7efb07a
104 rdf:rest rdf:nil
105 N7baef38b47814fb2956dbfd3394aa22f schema:familyName Zighed
106 schema:givenName Djamel A.
107 rdf:type schema:Person
108 N83fdca798d3045fc97f05fd8ecf8653f schema:name Springer Nature - SN SciGraph project
109 rdf:type schema:Organization
110 Na58097ccb7cb4ea792f7eabf22d613f4 rdf:first Ne2744f21e17c432882205f4f904f7102
111 rdf:rest N732486e74e8945efa4fb492caeb5f2a2
112 Nba3df498feb3486788661b23e328b969 schema:isbn 978-3-540-41066-9
113 978-3-540-45372-7
114 schema:name Principles of Data Mining and Knowledge Discovery
115 rdf:type schema:Book
116 Ncd4accfeb4b24775a77828959ee0d219 schema:name Springer Nature
117 rdf:type schema:Organisation
118 Ne2744f21e17c432882205f4f904f7102 schema:familyName Komorowski
119 schema:givenName Jan
120 rdf:type schema:Person
121 Ne36506f54c3643038076a8c7d7efb07a schema:familyName Żytkow
122 schema:givenName Jan
123 rdf:type schema:Person
124 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
125 schema:name Information and Computing Sciences
126 rdf:type schema:DefinedTerm
127 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
128 schema:name Computation Theory and Mathematics
129 rdf:type schema:DefinedTerm
130 sg:person.013324511711.75 schema:affiliation grid-institutes:grid.10392.39
131 schema:familyName Güntzer
132 schema:givenName Ulrich
133 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013324511711.75
134 rdf:type schema:Person
135 sg:person.014732763563.11 schema:affiliation grid-institutes:grid.10392.39
136 schema:familyName Hipp
137 schema:givenName Jochen
138 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014732763563.11
139 rdf:type schema:Person
140 sg:person.07467643565.95 schema:affiliation grid-institutes:grid.5433.1
141 schema:familyName Nakhaeizadeh
142 schema:givenName Gholamreza
143 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07467643565.95
144 rdf:type schema:Person
145 grid-institutes:grid.10392.39 schema:alternateName Wilhelm Schickard-Institute, University of Tübingen, 72076, Tübingen, Germany
146 schema:name Wilhelm Schickard-Institute, University of Tübingen, 72076, Tübingen, Germany
147 rdf:type schema:Organization
148 grid-institutes:grid.5433.1 schema:alternateName DaimlerChrysler AG, Research & Technology FT3/AD, 89081, Ulm, Germany
149 schema:name DaimlerChrysler AG, Research & Technology FT3/AD, 89081, Ulm, Germany
150 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...