Efficient Mining of Association Rules Based on Formal Concept Analysis
L. Lakhal, и G. Stumme.
Formal Concept Analysis, том 3626 из Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2005)

Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to

URL

http://dx.doi.org/10.1007/11528784_10

искать в

К этой публикации ещё не было создано рецензий.

распределение оценок

средняя оценка пользователей0,0 из 5.0 на основе 0 рецензий

Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)

@incollection{lakhal2005efficient,
  abstract = {Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to },
  added-at = {2014-11-27T17:52:26.000+0100},
  author = {Lakhal, Lotfi and Stumme, Gerd},
  biburl = {https://puma.uni-kassel.de/bibtex/2fbb41ddbb0a52d1ecca438655e652f09/stephandoerfel},
  booktitle = {Formal Concept Analysis},
  description = {Efficient Mining of Association Rules Based on Formal Concept Analysis - Springer},
  doi = {10.1007/11528784_10},
  editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf},
  interhash = {f5777a0f9dccfcf4f9968119d77297fc},
  intrahash = {fbb41ddbb0a52d1ecca438655e652f09},
  isbn = {978-3-540-27891-7},
  keywords = {association fca literature rules survey},
  language = {English},
  pages = {180-195},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  timestamp = {2014-11-27T17:52:26.000+0100},
  title = {Efficient Mining of Association Rules Based on Formal Concept Analysis},
  url = {http://dx.doi.org/10.1007/11528784_10},
  volume = 3626,
  year = 2005
}

%0 Book Section
%1 lakhal2005efficient
%A Lakhal, Lotfi
%A Stumme, Gerd
%B Formal Concept Analysis
%D 2005
%E Ganter, Bernhard
%E Stumme, Gerd
%E Wille, Rudolf
%I Springer Berlin Heidelberg
%K association fca literature rules survey
%P 180-195
%R 10.1007/11528784_10
%T Efficient Mining of Association Rules Based on Formal Concept Analysis
%U http://dx.doi.org/10.1007/11528784_10
%V 3626
%X Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to
%@ 978-3-540-27891-7

PUMA

Efficient Mining of Association Rules Based on Formal Concept Analysis
L. Lakhal, и G. Stumme.
Formal Concept Analysis, том 3626 из Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2005)

Tags

Пользователи данного ресурса

Комментарии и рецензии

Цитировать эту публикацию

PUMA

Efficient Mining of Association Rules Based on Formal Concept AnalysisL. Lakhal, и G. Stumme. Formal Concept Analysis, том 3626 из Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2005)

Tags

Пользователи данного ресурса

Комментарии и рецензии

Цитировать эту публикацию

Efficient Mining of Association Rules Based on Formal Concept Analysis
L. Lakhal, и G. Stumme.
Formal Concept Analysis, том 3626 из Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2005)