Discovering frequent itemset with maximum time-window on temporal transaction database using variable neighborhood search

DOI10.1016/J.ENDM.2012.10.019zbMATH Open1268.68157OpenAlexW2056121229MaRDI QIDQ2840765FDOQ2840765

Authors: Yun Tian, Yi-Yong Xiao, Qiu-Hong Zhao 

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.019

Recommendations

• Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search
• Looking into the seeds of time: Discovering temporal patterns in large transaction sets
• Temporal association rules mining algorithm based on frequent item sets tree
• scientific article; zbMATH DE number 1983139
• MAX-FISM: mining (recently) maximal frequent itemsets over data streams using the sliding window model

zbMATH Keywords

data mininginteger programmingvariable neighborhood searchassociation rule with time-window

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Integer programming (90C10) Database theory (68P15)

Cites Work

• Mining hybrid sequential patterns and sequential rules

Cited In (1)

• Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search

This page was built for publication: Discovering frequent itemset with maximum time-window on temporal transaction database using variable neighborhood search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840765)