Data Mining for Association Rules and Sequential Patterns: Sequential and Parallel Algorithms
Data mining includes a wide range of activities such as classification, clustering, similarity analysis, summarization, association rule and sequential pattern discovery, and so forth. The book focuses on the last two previously listed activities. It provides a unified presentation of algorithms for...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
Springer New York
2001
|
| Ausgabe: | 1st ed. 2001 |
| Schlagworte: | |
| Online-Zugang: | UBY01 URL des Eerstveröffentlichers |
| Zusammenfassung: | Data mining includes a wide range of activities such as classification, clustering, similarity analysis, summarization, association rule and sequential pattern discovery, and so forth. The book focuses on the last two previously listed activities. It provides a unified presentation of algorithms for association rule and sequential pattern discovery. For both mining problems, the presentation relies on the lattice structure of the search space. All algorithms are built as processes running on this structure. Proving their properties takes advantage of the mathematical properties of the structure. Part of the motivation for writing this book was postgraduate teaching. One of the main intentions was to make the book a suitable support for the clear exposition of problems and algorithms as well as a sound base for further discussion and investigation. Since the book only assumes elementary mathematical knowledge in the domains of lattices, combinatorial optimization, probability calculus, and statistics, it is fit for use by undergraduate students as well. The algorithms are described in a C-like pseudo programming language. The computations are shown in great detail. This makes the book also fit for use by implementers: computer scientists in many domains as well as industry engineers |
| Beschreibung: | 1 Online-Ressource (X, 254 p) |
| ISBN: | 9781461300854 |
| DOI: | 10.1007/978-1-4613-0085-4 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047064188 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2001 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461300854 |9 978-1-4613-0085-4 | ||
| 024 | 7 | |a 10.1007/978-1-4613-0085-4 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-1-4613-0085-4 | ||
| 035 | |a (OCoLC)1227481364 | ||
| 035 | |a (DE-599)BVBBV047064188 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 082 | 0 | |a 005.74 |2 23 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 302 |0 (DE-625)143652: |2 rvk | ||
| 100 | 1 | |a Adamo, Jean-Marc |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Data Mining for Association Rules and Sequential Patterns |b Sequential and Parallel Algorithms |c by Jean-Marc Adamo |
| 250 | |a 1st ed. 2001 | ||
| 264 | 1 | |a New York, NY |b Springer New York |c 2001 | |
| 300 | |a 1 Online-Ressource (X, 254 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 520 | |a Data mining includes a wide range of activities such as classification, clustering, similarity analysis, summarization, association rule and sequential pattern discovery, and so forth. The book focuses on the last two previously listed activities. It provides a unified presentation of algorithms for association rule and sequential pattern discovery. For both mining problems, the presentation relies on the lattice structure of the search space. All algorithms are built as processes running on this structure. Proving their properties takes advantage of the mathematical properties of the structure. Part of the motivation for writing this book was postgraduate teaching. One of the main intentions was to make the book a suitable support for the clear exposition of problems and algorithms as well as a sound base for further discussion and investigation. Since the book only assumes elementary mathematical knowledge in the domains of lattices, combinatorial optimization, probability calculus, and statistics, it is fit for use by undergraduate students as well. The algorithms are described in a C-like pseudo programming language. The computations are shown in great detail. This makes the book also fit for use by implementers: computer scientists in many domains as well as industry engineers | ||
| 650 | 4 | |a Database Management | |
| 650 | 4 | |a Information Storage and Retrieval | |
| 650 | 4 | |a Artificial Intelligence | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Database management | |
| 650 | 4 | |a Information storage and retrieval | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Algorithms | |
| 650 | 0 | 7 | |a Data Mining |0 (DE-588)4428654-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Data Mining |0 (DE-588)4428654-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461265115 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780387950488 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461300861 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4613-0085-4 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2000/2004 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032471300 | ||
| 966 | e | |u https://doi.org/10.1007/978-1-4613-0085-4 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182061873889280 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Adamo, Jean-Marc |
| author_facet | Adamo, Jean-Marc |
| author_role | aut |
| author_sort | Adamo, Jean-Marc |
| author_variant | j m a jma |
| building | Verbundindex |
| bvnumber | BV047064188 |
| classification_rvk | ST 130 ST 302 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-1-4613-0085-4 (OCoLC)1227481364 (DE-599)BVBBV047064188 |
| dewey-full | 005.74 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.74 |
| dewey-search | 005.74 |
| dewey-sort | 15.74 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/978-1-4613-0085-4 |
| edition | 1st ed. 2001 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03309nmm a2200553zc 4500</leader><controlfield tag="001">BV047064188</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2001 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461300854</subfield><subfield code="9">978-1-4613-0085-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4613-0085-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-1-4613-0085-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227481364</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064188</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.74</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 302</subfield><subfield code="0">(DE-625)143652:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Adamo, Jean-Marc</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Data Mining for Association Rules and Sequential Patterns</subfield><subfield code="b">Sequential and Parallel Algorithms</subfield><subfield code="c">by Jean-Marc Adamo</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2001</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer New York</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (X, 254 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Data mining includes a wide range of activities such as classification, clustering, similarity analysis, summarization, association rule and sequential pattern discovery, and so forth. The book focuses on the last two previously listed activities. It provides a unified presentation of algorithms for association rule and sequential pattern discovery. For both mining problems, the presentation relies on the lattice structure of the search space. All algorithms are built as processes running on this structure. Proving their properties takes advantage of the mathematical properties of the structure. Part of the motivation for writing this book was postgraduate teaching. One of the main intentions was to make the book a suitable support for the clear exposition of problems and algorithms as well as a sound base for further discussion and investigation. Since the book only assumes elementary mathematical knowledge in the domains of lattices, combinatorial optimization, probability calculus, and statistics, it is fit for use by undergraduate students as well. The algorithms are described in a C-like pseudo programming language. The computations are shown in great detail. This makes the book also fit for use by implementers: computer scientists in many domains as well as industry engineers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Database Management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information Storage and Retrieval</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial Intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Database management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information storage and retrieval</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Data Mining</subfield><subfield code="0">(DE-588)4428654-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Data Mining</subfield><subfield code="0">(DE-588)4428654-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781461265115</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780387950488</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781461300861</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4613-0085-4</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471300</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4613-0085-4</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047064188 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:22Z |
| indexdate | 2024-07-10T09:01:34Z |
| institution | BVB |
| isbn | 9781461300854 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471300 |
| oclc_num | 1227481364 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 1 Online-Ressource (X, 254 p) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Springer New York |
| record_format | marc |
| spelling | Adamo, Jean-Marc Verfasser aut Data Mining for Association Rules and Sequential Patterns Sequential and Parallel Algorithms by Jean-Marc Adamo 1st ed. 2001 New York, NY Springer New York 2001 1 Online-Ressource (X, 254 p) txt rdacontent c rdamedia cr rdacarrier Data mining includes a wide range of activities such as classification, clustering, similarity analysis, summarization, association rule and sequential pattern discovery, and so forth. The book focuses on the last two previously listed activities. It provides a unified presentation of algorithms for association rule and sequential pattern discovery. For both mining problems, the presentation relies on the lattice structure of the search space. All algorithms are built as processes running on this structure. Proving their properties takes advantage of the mathematical properties of the structure. Part of the motivation for writing this book was postgraduate teaching. One of the main intentions was to make the book a suitable support for the clear exposition of problems and algorithms as well as a sound base for further discussion and investigation. Since the book only assumes elementary mathematical knowledge in the domains of lattices, combinatorial optimization, probability calculus, and statistics, it is fit for use by undergraduate students as well. The algorithms are described in a C-like pseudo programming language. The computations are shown in great detail. This makes the book also fit for use by implementers: computer scientists in many domains as well as industry engineers Database Management Information Storage and Retrieval Artificial Intelligence Algorithm Analysis and Problem Complexity Database management Information storage and retrieval Artificial intelligence Algorithms Data Mining (DE-588)4428654-5 gnd rswk-swf Data Mining (DE-588)4428654-5 s DE-604 Erscheint auch als Druck-Ausgabe 9781461265115 Erscheint auch als Druck-Ausgabe 9780387950488 Erscheint auch als Druck-Ausgabe 9781461300861 https://doi.org/10.1007/978-1-4613-0085-4 Verlag URL des Eerstveröffentlichers Volltext |
| spellingShingle | Adamo, Jean-Marc Data Mining for Association Rules and Sequential Patterns Sequential and Parallel Algorithms Database Management Information Storage and Retrieval Artificial Intelligence Algorithm Analysis and Problem Complexity Database management Information storage and retrieval Artificial intelligence Algorithms Data Mining (DE-588)4428654-5 gnd |
| subject_GND | (DE-588)4428654-5 |
| title | Data Mining for Association Rules and Sequential Patterns Sequential and Parallel Algorithms |
| title_auth | Data Mining for Association Rules and Sequential Patterns Sequential and Parallel Algorithms |
| title_exact_search | Data Mining for Association Rules and Sequential Patterns Sequential and Parallel Algorithms |
| title_exact_search_txtP | Data Mining for Association Rules and Sequential Patterns Sequential and Parallel Algorithms |
| title_full | Data Mining for Association Rules and Sequential Patterns Sequential and Parallel Algorithms by Jean-Marc Adamo |
| title_fullStr | Data Mining for Association Rules and Sequential Patterns Sequential and Parallel Algorithms by Jean-Marc Adamo |
| title_full_unstemmed | Data Mining for Association Rules and Sequential Patterns Sequential and Parallel Algorithms by Jean-Marc Adamo |
| title_short | Data Mining for Association Rules and Sequential Patterns |
| title_sort | data mining for association rules and sequential patterns sequential and parallel algorithms |
| title_sub | Sequential and Parallel Algorithms |
| topic | Database Management Information Storage and Retrieval Artificial Intelligence Algorithm Analysis and Problem Complexity Database management Information storage and retrieval Artificial intelligence Algorithms Data Mining (DE-588)4428654-5 gnd |
| topic_facet | Database Management Information Storage and Retrieval Artificial Intelligence Algorithm Analysis and Problem Complexity Database management Information storage and retrieval Artificial intelligence Algorithms Data Mining |
| url | https://doi.org/10.1007/978-1-4613-0085-4 |
| work_keys_str_mv | AT adamojeanmarc dataminingforassociationrulesandsequentialpatternssequentialandparallelalgorithms |