Two approaches to data mining with association rules are compared – the apriori algorithm and the ASSOC procedure. The first one was developed for market basket analysis at the beginning of 1990s. An association rule is understood as an implication between conjunctions of attribute-value pairs. The ASSOC procedure is an implementation of the GUHA method of mechanizing hypothesis formation developed since the 1960s. ASSOC deals with association rules – general relations of two general Boolean attributes. Arules – a computational environment for mining association rules based on apriori and the 4ft-Miner procedure – an implementation of the ASSOC procedure are discussed and compared. It is shown that the arules approach to missing information does not correspond to Kleene’s approach and this can lead to a large number of misleading rules. It is also shown that a secured completion developed for the ASSOC procedure avoids this problem.
AggarwalC.C.HanJ. et al., Frequent Pattern Mining, Springer, Berlin, 2014.
2.
AggarwalC.C., Data Mining, Springer, Berlin, 2015.
3.
AgrawalR.ImielinskiT. and SwamiA., Mining Associations between Sets of Items in Large Databases, in: Proceedings of the 1993 ACM SIGMOD International Conference on Management of DataBunemanP. and JajodiaS., eds, ACM Press, Fort-Collins, 1993, pp. 207–216.
4.
BrianL.SwamiA.N. and WidomJ., Clustering association rules, in: Proceedings of the Thirteenth International Conference on Data EngineeringGrayA. and LarsonP., eds, IEEE Computer Society, 1997, pp. 220–231.
5.
BrinS.RastogiR. and KyuseokS., Mining optimized gain rules for numeric attributes, Knowledge and Data Engineering15 (2003), 324–338.
DehaspeL. and De RaedtL., Mining association rules in multiple relations, in: Inductive Logic ProgrammingLavračN. and DzeroskiS., eds, Springer-Verlag, Berlin Heidelberg, 1997, pp. 125–132.
8.
FlachP.A. and LachicheN., Confirmation-guided discovery of first-order rules with Tertius, Machine Learning42 (2001), 61–95.
9.
FukudaT.MorimotoY.MorishitaS. and TokuyamaT., Mining Optimized Association Rules for Numeric Attributes, Journal of Computer and System Sciences58 (1999), 1–12.
10.
GasmiG.Ben YahiaS.NguifoE.M. and BoukerS., Extraction of Association Rules Based on Literalsets, in: Data Warehousing and Knowledge DiscoverySongI.Y.EderJ. and NguyenT.M., eds, Springer, 2007, pp. 293–302.
11.
GengL. and HamiltonH.J., Interestingness Measures for Data Mining: A survey, ACM Computing Surveys (CSUR)38 (2006), 1–32.
12.
HahslerM.BuchtaC.GruenB. and HornikK., arules: Mining Association Rules and Frequent Itemsets. R package version 1.3-1, http://CRAN.R-project.org/package=arules, cited 12 Feb. 2016.
13.
HájekP. (guest ed.), special issue on GUHA, International Journal of Man-Machine Studies10 (1978).
14.
HájekP., The new version of the GUHA procedure ASSOC, in: Proceedings COMPSTAT 1984HavránekT.ŠidákZ. and NovákM., eds, Springer-Verlag, Berlin Heidelberg, 1984, pp. 360–365.
15.
HájekP. and HavránekT., Mechanising Hypothesis Formation – Mathematical Foundations for a General Theory, Springer-Verlag, Berlin Heidelberg New York, 1978, http://www.cs.cas.cz/hajek/guhabook/, cited 12 Feb. 2016.
16.
HájekP.HavránekT. and ChytilM., GUHA Method, Academia, Praha, 1983 (in Czech).
17.
HájekP.HavelI. and ChytilM., The GUHA method of automatic hypotheses determination, Computing1 (1966), 293–308.
18.
HájekP.HoleňaM. and RauchJ., The GUHA method and its meaning for data mining, Journal of Computer and System Sciences76 (2010), 34–48.
19.
HamrouniT.SadokB.Y. and EngelbertN., Generalization of association rules through disjunction, Annals of Mathematics and Artificial Intelligence59 (2010), 201–222.
20.
HongT.P.LinK.Y. and WangS.L., Fuzzy data mining for interesting generalized association rules, Fuzzy Sets and Systems138 (2003), 255–269.
21.
LuoK.WangL. and TongX., Mining association rules in incomplete information systems, Journal of Central South University of Technology151 (2008), 733–737.
22.
KleeneS.C., Introduction to MetamathematicsVan NostrandD., Princeton, NJ, 1950.
23.
LinT.Y.HuX. and LouieE., A fast association rule algorithm based on bitmap and granular computing, in: Proceedings The 12th IEEE International Conference on Fuzzy Systems (Volume:1)NasraouiO.FriguiH. and KellerJ.M., eds, IEEE, Piscataway, NJ, 2003, pp. 678–683.
24.
LISp-Miner system webpage, URL: lispminer.vse.cz, cited 12 Feb. 2016.
25.
MansinghG.Osei-BrysonK.M. and ReichgeltH., Using ontologies to facilitate post-processing of association rules by domain experts, Information Sciences181 (2011), 419–434.
26.
Minaei-BidgoliB.BarmakiR. and NasiriM., Mining numerical association rules via multi-objective genetic algorithms, Information Sciences233 (2013), 15–24.
27.
PearsR.KohY.S.DobbieG. and YeapW., Weighted association rule mining via a graph based connectivity model, Information Sciences218 (2013), 61–84.
28.
QiaoM. and ZhangD., Efficiently matching frequent patterns based on bitmap inverted files built from closed itemsets, International Journal on Artificial Intelligence Tools21 (2012), 1–19.
29.
The R Project for Statistical Computing, https://www.R-project.org/ cited 12 Feb. 2016.
30.
RagelA. and CremilleuxB., Treatment of Missing Values for Association Rules, in: 2nd Pacific-Asia Conference on Research and Development in Knowledge Discovery and Data MiningWuX.KotagiriR. and KorbK.B., eds, Springer-Verlag, Berlin Heidelberg, 1998, pp. 258–279.
31.
RalbovskýM. and KuchařT., Using Disjunctions in Association Mining, in: Advances in Data Mining – Theoretical Aspects and ApplicationsPernerP., eds, Springer-Verlag, Berlin Heidelberg, 2007, pp. 339–351.
32.
De RaedtL.TiasG. and NijssenS., Constraint programming for itemset mining, in: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data MiningLiY.LiuB. and SarawagiS., eds, ACM New York, NY, 2008, pp. 204–212.
33.
De RaedtL. and ZimmermannA., Constraint-Based Pattern Set Mining, in: 7th SIAM International Conference on Data MiningApteC.LiuB., and ParthasarathyS., eds, Cambridge University Press, Cambridge, 2007, pp. 237–248.
34.
RastogiR. and ShimK., Mining optimized support rules for numeric attributes, Information Systems26 (2001), 425–444.
35.
RauchJ., Ein Beitrag zu der GUHA method in der dreivertigen logic, Kybernetika11 (1975), 101–113.
36.
RauchJ., Some Remarks on Computer Realizations of GUHA Procedures, International Journal of Man Machine Studies10 (1978), 23–28.
37.
RauchJ., Considerations on Logical Calculi for Dealing with Knowledge in Data Mining, in: Advances in Data ManagementRasZ.W. and DardzinskaA., eds, Springer-Verlag, Berlin Heidelberg, 2009, pp. 177–202.
38.
RauchJ., Observational Calculi and Association Rules, Springer-Verlag, Berlin Heidelberg, 2013.
39.
RauchJ., Formal Framework for Data Mining with Association Rules and Domain Knowledge – Overview of an Approach, Fundamenta Informaticae137 (2015), 171–217.
40.
RauchJ. and ŠimůnekM., Mining for 4ft Rules, in: Discovery Science, Third International ConferenceArikawaS. and MorishitaS., eds, Springer-Verlag, Berlin Heidelberg, 2000, pp. 268–272.
41.
RauchJ. and ŠimůnekM., An Alternative Approach to Mining Association Rules, in: Data Mining: Foundations, Methods, and ApplicationsLinT.Y., eds, Springer-Verlag, Berlin Heidelberg, 2005, pp. 219–238.
42.
RauchJ. and ŠimůnekM., Dealing with Background Knowledge in the SEWEBAR Project, in: Knowledge Discovery Enhanced with Semantic and Social InformationBerendtB., eds, Springer-Verlag, Berlin Heidelberg, 2009, pp. 89–106.
43.
RauchJ. and ŠimůnekM., Action Rules and the GUHA Method: Preliminary Considerations and Results, in: Foundations of Intelligent SystemsRauchJ., eds, Springer-Verlag, Berlin Heidelberg, 2009, pp. 76–87.
44.
RauchJ. and ŠimůnekM., Applying Domain Knowledge in Association Rules Mining Process – First Experience, in: Procedings Foundations of Intelligent SystemsKryszkiewiczM., eds, Springer-Verlag, Berlin Heidelberg, 2011, pp. 113–122.
45.
RauchJ. and ŠimůnekM., Learning Association Rules from Data through Domain Knowledge and Automation, in: Proceedings Rules on the From Theory to ApplicationsBikakisA.FodorP., and RomanD., eds, Springer-Verlag, Berlin Heidelberg, 2014, pp. 266–280.
46.
RauchJ. and ŠimůnekM., Knowledge Discovery in Databases, Lisp-Miner and GUHA, Oeconomica, Prague, 2014 (in Czech).
47.
ŠimůnekM., Academic KDD Project LISp-Miner, in: Proceedings Advances in Soft Computing and Intelligent Systems – Desing and ApplicationsAbrahamA.FrankeK. and KoppenK., eds, Springer-Verlag, Berlin Heidelberg, 2003, pp. 263–272.
48.
ŠimůnekM., LISp-Miner Control Language description of scripting language implementation, Journal of Systems Integration5 (2014), 28–44, URL: http://wwwsi-journal.org/index.php/JSI/article/viewFile/193/140.
49.
SongW.YangB. and XuY., Index-maxminer: a new maximal frequent itemset mining algorithm, International Journal on Artificial Intelligence Tools17 (2008), 303–320.
50.
SrikantR. and AgrawalR., Mining generalized association rules, Future Generation Computer Systems13 (1997), 161–180.
51.
TiasG.NijssenS. and De RaedtL., Itemset mining: A constraint programming perspective, Artificial Intelligence175 (2011), 1951–1983.
52.
VojířS.ZemanV.KuchařJ. and KliegrT., EasyMiner/R Preview: Towards a Web Interface for Association Rule Learning and Classification in R, in: Proceedings of the RuleML 2015 ChallengeBassiliadesN., eds, 2015, http://ceur-wsorg/Vol-1417/paper10.pdf.
53.
YunU.ShinH.RyuK. and YoonE., An efficient mining algorithm for maximal weighted frequent patterns in transactional databases, Knowledge-Based Systems33 (2012), 53–64.
