@inproceedings{862c1597ca07493aa492506a4d953712,
title = "Towards efficient data re-mining (DRM)",
abstract = "The problem that we tackle here is a practical one: When users interactively mine association rules, it is often the case that they have to continuously tune two thresholds: minimum support and minimum confidence, which describe the users' changing requirements. In this paper, we present an efficient data re-mining (DRM) technique for updating previously discovered association rules in light of threshold changes.",
author = "Jiming LIU and Jian Yin",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2001 ; Conference date: 16-04-2001 Through 18-04-2001",
year = "2001",
doi = "10.1007/3-540-45357-1_43",
language = "English",
isbn = "3540419101",
series = "Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)",
publisher = "Springer Verlag",
pages = "406--412",
editor = "David Cheung and Williams, {Graham J.} and Qing Li",
booktitle = "Advances in Knowledge Discovery and Data Mining - 5th Pacific-Asia Conference, PAKDD 2001, Proceedings",
address = "Germany",
}