<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">EasyMiner -Short History of Research and Current Development</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Tomáš</forename><surname>Kliegr</surname></persName>
							<affiliation key="aff0">
								<orgName type="department" key="dep1">Department of Information and Knowledge Engineering</orgName>
								<orgName type="department" key="dep2">Faculty of Informatics and Statistics</orgName>
								<orgName type="institution">University of Economics</orgName>
								<address>
									<addrLine>W. Churchill Sq. 4</addrLine>
									<settlement>Prague, Prague 3</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Jaroslav</forename><surname>Kuchař</surname></persName>
							<affiliation key="aff1">
								<orgName type="department">Faculty of Information Technology</orgName>
								<orgName type="laboratory">Web Intelligence Research Group</orgName>
								<orgName type="institution">Czech Technical University</orgName>
								<address>
									<addrLine>Thákurova 9, 160 00</addrLine>
									<settlement>Prague 6</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Stanislav</forename><surname>Vojíř</surname></persName>
							<affiliation key="aff0">
								<orgName type="department" key="dep1">Department of Information and Knowledge Engineering</orgName>
								<orgName type="department" key="dep2">Faculty of Informatics and Statistics</orgName>
								<orgName type="institution">University of Economics</orgName>
								<address>
									<addrLine>W. Churchill Sq. 4</addrLine>
									<settlement>Prague, Prague 3</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Václav</forename><surname>Zeman</surname></persName>
							<affiliation key="aff0">
								<orgName type="department" key="dep1">Department of Information and Knowledge Engineering</orgName>
								<orgName type="department" key="dep2">Faculty of Informatics and Statistics</orgName>
								<orgName type="institution">University of Economics</orgName>
								<address>
									<addrLine>W. Churchill Sq. 4</addrLine>
									<settlement>Prague, Prague 3</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">EasyMiner -Short History of Research and Current Development</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">280A4031F0CBA8E5A5B65B8F61EDB8AA</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T10:11+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"> EasyMiner (easyminer.eu)  <p>is an academic data mining project providing data mining of association rules, building of classification models based on association rules and outlier detection based on frequent pattern mining. It differs from other data mining systems by adapting the "web search" paradigm. It is web-based, providing both a REST API and a user interface, and puts emphasis on interactivity, simplicity of user interface and immediate response. This paper will give an overview of research related to the EasyMiner project.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1">Introduction</head><p>In this paper, we present the history of research and development of the EasyMiner project http://easyminer. eu. EasyMiner is an academic data mining project providing data mining of association rules, building of classification models based on association rules and outlier detection based on frequent pattern mining.</p><p>EasyMiner was to our knowledge the first interactive web-based data mining system that supported the complete machine learning process. While today there are several web-based machine learning systems on the market 1 , owing to continuous development EasyMiner provides distinct user experience. While most existing machine learning systems offer versatile user interfaces, where the user has to in some way for each task compose a new machine learning workflow, in EasyMiner the user interface is crafted to provide the "web search" experience. The user visually constructs a query against the data, and the system responds with a set of interesting patterns (presented as rules) or a classifier (Figure <ref type="figure" target="#fig_0">1</ref>).</p><p>Over the years of development, EasyMiner served as a testbed for a number of new technologies and research ideas. The purpose of this paper is to give a brief overview of this research.</p><p>This paper is organized as follows. Section 2 is focused on SEWEBAR-CMS, the predecessor of EasyMiner, used in research on the use of domain knowledge in data mining. Section 3 focuses on association rule discovery. Section 4 presents the adaptation of EasyMiner for learning business rules and Section 5 consequently for association rule classification. Section 6 presents the current focus on 1 Such as BigML.com or Microsoft Azure. outlier detection. The architecture of the system is presented in Section 7. Since the beginnings, the research was accompanied with standardization efforts, which are presented in Section 8. The current development efforts focus also on distributed computation platforms -this is covered in Section 9. Section 10 provides an overview of the features that were at some point in time developed as well as of those that are supported by the current version of EasyMiner. Finally, the conclusions present a case for using EasyMiner as a component in new project requiring data mining functionality and refers the interested reader to other publications regarding comparison with other machine learning as a service (MLaaS) systems.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2">Handling of Domain Knowledge</head><p>EasyMiner evolved from the SEWEBAR (SEmantic-WEB Analytical Reports) project, which focused on semantically readable machine learning. In <ref type="bibr" target="#b8">[9]</ref>, we presented SEWEBAR-CMS as a set of extensions for the Joomla! content management system (CMS) that extends it with functionality required to serve as a communication platform between the data analyst, domain expert and the report user. The system later supported elicitation of domain knowledge from the analyst <ref type="bibr" target="#b11">[12]</ref>. Association rules discovered from data with the LISp-Miner system (http: //lispminer.vse.cz) were stored in a semantic form in the SEWEBAR-CMS system. The background knowledge was used to help answer user search queries, for example, to find rules that are contradicting existing domain knowledge <ref type="bibr" target="#b5">[6]</ref>. Another novel element in the system was the use of ontology for representation of the data mining domain.</p><p>Related research focused on improving semantic capabilities of content management systems <ref type="bibr" target="#b2">[3]</ref> and on designing ontologies and schemata for representation of background knowledge <ref type="bibr" target="#b7">[8,</ref><ref type="bibr" target="#b10">11]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3">Association Rule Discovery</head><p>In its first release, EasyMiner provided a web-based interface for the LISp-Miner system, which was used for association rule mining <ref type="bibr" target="#b22">[23]</ref>. EasyMiner interacted with LISp-Miner using its LM-Connect component, which is a web application providing the functionality of LISp-Miner through REST API. Table <ref type="table">1</ref>: Features supported in EasyMiner 2.4. Year -when was the paper describing the feature published, API -feature available in the REST API, UI -feature available in the user interface.</p><p>EasyMiner with LISp-Miner backend offered several unique features: 1. negation on attributes, 2. disjunction between attributes, 3. subpatterns allowing for scoping logical connectives, 4. multiple interest measures (called quantifiers in GUHA), 5. mines directly on multivalued attributes, no need to create "items", 6. dynamic binning operators (called coefficients in GUHA), 7. PMML-based import and export, 8. grid support.</p><p>Since LM-Connect component is no longer developed and maintained, the integration of the current version of EasyMiner and LISp-Miner is thus currently not working. <ref type="foot" target="#foot_0">2</ref>The current version of EasyMiner primarily relies on the R arules package <ref type="bibr" target="#b1">[2]</ref>, which wraps a C implementation of the apriori association rule mining algorithm <ref type="bibr" target="#b0">[1]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4">Learning Business Rules</head><p>One of the first use cases for EasyMiner was learning business rules. In <ref type="bibr" target="#b20">[21]</ref> we presented a software module for EasyMiner, which allows to export selected rules to Business Rules Management System (BRMS) Drools, transforming the output of association rule learning into the DRL format supported by Drools. We found that the main obstacles for a straightforward use of association rules as candidate business rules are the excessive number of rules discovered even on small datasets, and the fact that contradicting rules are generated. In <ref type="bibr" target="#b4">[5]</ref> we propose that a potential solution to these problems is provided by the seminal association rule classification algorithm CBA <ref type="bibr" target="#b15">[16]</ref>. In <ref type="bibr" target="#b19">[20]</ref> we presented a software module for EasyMiner, which allows the domain expert to edit the discovered rules.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5">Association Rule Based Classification</head><p>In <ref type="bibr" target="#b4">[5]</ref> we started to use the CBA algorithm for postprocessing association rule learning results into a classifier. In <ref type="bibr" target="#b21">[22]</ref> we presented an extension for EasyMiner for building of classification models. A benchmark against standard symbolic classification algorithms on a news recommender task was presented in <ref type="bibr" target="#b6">[7]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6">Outlier Detection</head><p>The most recent addition of new tasks supported by EasyMiner is frequent pattern-based anomaly (outlier) detection. The main idea of the approach is that if an instance contains more frequent patterns, it is unlikely to be an anomaly. The presence or absence of the frequent patterns is then used to assign the deviation level <ref type="bibr" target="#b3">[4]</ref>. In <ref type="bibr" target="#b18">[19]</ref> we present extension of EasyMiner REST API with our innovated outlier detection algorithm called Frequent Pattern Isolation (FPI) <ref type="bibr" target="#b14">[15]</ref> that is inspired by an existing algorithm called Isolation Forests (IF) <ref type="bibr" target="#b16">[17,</ref><ref type="bibr" target="#b17">18]</ref>. Since PMML does not yet support outlier (anomaly) detection, in <ref type="bibr" target="#b13">[14]</ref> we present our proposal for a new PMML outlier model. The goal of our work was to design modular solution that would support broader range of anomaly detection algorithms including our FPI method.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7">EasyMiner Architecture</head><p>During the development of EasyMiner system, its architecture was transformed to multiple reusable web services. A schema of the architecture is shown in Figure <ref type="figure" target="#fig_1">2</ref>. All the services are fully documented in Swagger. For storing and preparing data before mining, the system uses services EasyMiner-Data and EasyMiner-Preprocessing. EasyMiner-Data is a web services for management of data sources. It supports upload of data files in CSV and RDF and stores them into databases as the set of transactions. EasyMiner-Preprocessing service supports creation of datasets from data sources stored using EasyMiner-Data using user-defined preprocessing methods. The attributes for data mining are created from uploaded data fields using one of these preprocessing algorithms: each value-one bin, enumeration of intervals, enumeration of nominal values, equidistant intervals, equifrequent intervals, equisized intervals (by minimal support of every interval). The preprocessing algorithms as well as data storage are independent of the selected data mining algorithm. The implemented web services support hashing functionality to avoid potentially problems with special characters in attribute names and its values. The mining following services work on the "safe" datasets with hashed values.</p><p>The main data mining functionality is provided by the service EasyMiner-Miner. This web service provides association rule learning, prunning of discovered association rule sets and building of classification models and outlier detection. EasyMiner-Miner initializes execution of used R packages and another algorithms.</p><p>EasyMiner-Scorer is a web service for testing of classification models based on association rules.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="8">Distributed Backend: Spark/Hadoop</head><p>As laid out in the previous section, EasyMiner is modular in terms of mining backends. In addition to the default mining backend provided by the arules and rCBA packages, EasyMiner supports an alternate one built on top of Apache Spark/Hadoop introduced in <ref type="bibr" target="#b24">[25]</ref>.</p><p>The Spark backend is suitable for larger datasets, which can benefit from parallel computation distributed over multiple machines. The Spark backend also uses FP-Growth frequent pattern mining algorithm instead of apriori. FP-Growth is generally considered as faster than apriori. However, for smaller datasets using apriori with the R backend is recommended as it provides faster response times, due to the ability of the implementation to provide intermediate results as the mining progresses.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="9">Standardization Efforts (PMML)</head><p>Already the earliest research related to EasyMiner was linked to work on standardization efforts. While association rules were supported already in the early versions of PMML, the industry standard format for exchange of data mining models, the GUHA method that was initially used did not comply to this standard, since it produced rules containing number of constructs not supported by PMML. Since our research involved background knowledge elicited from domain experts, definition of data format supporting this type of knowledge was also required.</p><p>In <ref type="bibr" target="#b7">[8]</ref> we proposed a topic map-based ontology for association rule learning, which was based on the GUHA method and in <ref type="bibr" target="#b10">[11]</ref> an extension of this approach that dealt with domain knowledge. An extension of PMML for GUHA-based models was presented in <ref type="bibr" target="#b9">[10]</ref> and for handling of background knowledge <ref type="bibr" target="#b12">[13]</ref>. Neither of these efforts was successful -the ISO Topic Maps standard waded in favour of the W3C RDF/OWL stack. The industry was not concerned with exchange of background knowledge at the time, and support of GUHA method, implemented essentially only by the LISp-Miner system, increased complexity of the models as opposed to the existing PMML association rule models. <ref type="foot" target="#foot_2">3</ref> Our latest standardization effort is related to outlier detection <ref type="bibr" target="#b13">[14]</ref> and targets PMML. This proposal is closes industry adoption as it was included into a roadmap for the next release of PMML.</p><p>10 Features in the EasyMiner Version 2.4</p><p>Table <ref type="table">1</ref> presents an overview of the most salient features that were in some for published between 2009, when the first paper on EasyMiner's predecessor SEWEBAR-CMS appeared, and 2017, when the current version of EasyMiner was released. As follows from the table, a number of features is not supported in the current release.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="11">Using EasyMiner in Your Project</head><p>During the years of development, EasyMiner was extensively used by over thousand of students at the Faculty of Informatics and Statistics to complete their assignments in association rule learning. The software has also been used in several applied research projects. For example, within the linkedtv.eu project EasyMiner was used to analyze user preferences and within the openbudgets.eu project to analyze budgetary data.</p><p>The full project is based on composition of components and services with fully documented REST APIs. Most of the components and services <ref type="foot" target="#foot_3">4</ref> are available under open source Apache License, Version 2.0. This is an important factor which differentiates EasyMiner from the commercial MLaaS offerings. For a more detailed comparison with other machine learning systems refer to <ref type="bibr" target="#b23">[24]</ref>.</p><p>In addition to the visual web-based interface, the project exposes a REST API. This API provides full functionality of EasyMiner, including also functions, which are not yet available in the GUI. It is possible to use this API to extend your own project by data mining functionality. It is suitable for building of mashup applications or data processing using script languages. An example of data mining using API is available at http://www.easyminer. eu/api-tutorial.</p><p>EasyMiner can also be extended with new algorithms -rule mining, outlier detection or scorer service. For this purpose, the integration component EasyMinerCenter provides documented interfaces in PHP.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Visual query designer in EasyMiner.</figDesc><graphic coords="2,86.79,64.71,428.41,140.38" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Architecture of the system EasyMiner The central component (service) is EasyMinerCenter. This component integrates the functionality of other services and provides the main graphical web interface and REST API for end users. Internally, this component provides user account and task management, stores discovered association rules and works as authentication service for other components.For storing and preparing data before mining, the system uses services EasyMiner-Data and EasyMiner-Preprocessing. EasyMiner-Data is a web services for management of data sources. It supports upload of data files in CSV and RDF and stores them into databases as the set of transactions. EasyMiner-Preprocessing service supports creation of datasets from data sources stored</figDesc><graphic coords="3,79.99,373.37,214.21,163.62" type="bitmap" /></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_0">It should be noted that all the features list above can be used directly from the LISp-Miner system.</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" xml:id="foot_1">EasyMiner -Short History of Research and Current Development</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_2">Currently, EasyMiner supports export of association rule models in formats GUHA PMML also as in standard form PMML</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="4" xml:id="foot_3">.3 Association Rules.<ref type="bibr" target="#b3">4</ref> The main services were presented in section 7.</note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Acknowledgment</head><p>This paper was supported by IGA grant 29/2016 of the University of Economics, Prague.</p></div>
			</div>


			<div type="funding">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Feature</head><p>Year API UI Content Management System <ref type="bibr" target="#b8">[9]</ref> 2009 No No Semantic search over discovered rules <ref type="bibr" target="#b2">[3]</ref> 2010 No No Support for GUHA extension of PMML <ref type="bibr" target="#b9">[10]</ref> 2010 Yes Yes Query for related (confirming, contradicting) rules to the selected rule <ref type="bibr" target="#b5">[6]</ref> 2011 No No Editor of background knowledge <ref type="bibr" target="#b11">[12]</ref> 2011 No No LISp-Miner interface (disjunctions, negations, partial cedents, quantifiers, cuts, coefficients) <ref type="bibr" target="#b22">[23]</ref> 2012 No No Export of business rules to Drools <ref type="bibr" target="#b20">[21]</ref> 2013 No No Rule pruning with CBA <ref type="bibr" target="#b4">[5]</ref> 2014 Yes Yes Evaluation of quality of classification models <ref type="bibr" target="#b19">[20]</ref> 2014 Yes No Rule selection and editing for classification model building <ref type="bibr" target="#b19">[20]</ref> 2014 Yes No R interface (arules package) <ref type="bibr" target="#b21">[22]</ref> 2015 Yes Yes Spark backend <ref type="bibr" target="#b24">[25]</ref> 2016 Yes Yes Discretization algorithms <ref type="bibr" target="#b24">[25]</ref> 2016 Yes No Support for the input RDF data format 2017 Yes No Outlier detection <ref type="bibr" target="#b18">[19]</ref> 2017 Yes No</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Mining association rules between sets of items in large databases</title>
		<author>
			<persName><forename type="first">Rakesh</forename><surname>Agrawal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tomasz</forename><surname>Imielinski</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Arun</forename><forename type="middle">N</forename><surname>Swami</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">SIGMOD</title>
				<imprint>
			<publisher>ACM Press</publisher>
			<date type="published" when="1993">1993</date>
			<biblScope unit="page" from="207" to="216" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">The arules r-package ecosystem: analyzing interesting patterns from large transaction data sets</title>
		<author>
			<persName><forename type="first">Michael</forename><surname>Hahsler</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Sudheer</forename><surname>Chelluboina</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Kurt</forename><surname>Hornik</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Christian</forename><surname>Buchta</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Machine Learning Research</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="page" from="2021" to="2025" />
			<date type="published" when="2011-06">Jun. 2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">A PHP library for Ontopia-CMS integration</title>
		<author>
			<persName><forename type="first">Andrej</forename><surname>Hazucha</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Jakub</forename><surname>Balhar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kliegr</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">TMRA 2010</title>
				<imprint>
			<date type="published" when="2010">2010</date>
		</imprint>
		<respStmt>
			<orgName>University of Leipzig</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">FP-outlier: Frequent pattern based outlier detection</title>
		<author>
			<persName><forename type="first">Z</forename><surname>He</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Huang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Deng</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Computer Science and Information Systems/ComSIS</title>
		<imprint>
			<biblScope unit="volume">2</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="103" to="118" />
			<date type="published" when="2005">2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Learning business rules with association rule classifiers</title>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kliegr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Jaroslav</forename><surname>Kuchař</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Davide</forename><surname>Sottara</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Stanislav</forename><surname>Vojíř</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Rules on the Web. From Theory to Applications: 8th International Symposium, RuleML 2014, Co-located with the 21st European Conference on Artificial Intelligence, ECAI 2014</title>
				<editor>
			<persName><forename type="first">Dumitru</forename><surname>Roman</surname></persName>
		</editor>
		<meeting><address><addrLine>Prague, Czech Republic; Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer International Publishing</publisher>
			<date type="published" when="2014">August 18-20, 2014. 2014</date>
			<biblScope unit="page" from="236" to="250" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Instant feedback on discovered association rules with PMMLbased query-by-example</title>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kliegr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Andrej</forename><surname>Hazucha</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Marek</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Web Reasoning and Rule Systems</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Benchmark of rulebased classifiers in the news recommendation task</title>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kliegr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Jaroslav</forename><surname>Kuchař</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Experimental IR Meets Multilinguality, Multimodality, and Interaction -6th International Conference of the CLEF Association, CLEF 2015</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<editor>
			<persName><forename type="first">Josiane</forename><surname>Mothe</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Jacques</forename><surname>Savoy</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Jaap</forename><surname>Kamps</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Karen</forename><surname>Pinel-Sauvagnat</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">J</forename><forename type="middle">F</forename><surname>Gareth</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Eric</forename><surname>Jones</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Linda</forename><surname>Sanjuan</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Nicola</forename><surname>Cappellato</surname></persName>
		</editor>
		<editor>
			<persName><surname>Ferro</surname></persName>
		</editor>
		<meeting><address><addrLine>Toulouse, France</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2015">September 8-11, 2015. 9283. 2015</date>
			<biblScope unit="page" from="130" to="141" />
		</imprint>
	</monogr>
	<note>Proceedings</note>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Topic maps for association rule mining</title>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kliegr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Marek</forename><surname>Ovečka</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Jan</forename><surname>Zemánek</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of TMRA 2009</title>
				<meeting>TMRA 2009</meeting>
		<imprint>
			<date type="published" when="2009">2009</date>
		</imprint>
		<respStmt>
			<orgName>University of Leipzig</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Semantic analytical reports: A framework for post-processing data mining results</title>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kliegr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Martin</forename><surname>Ralbovský</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Vojtěch</forename><surname>Svátek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Milan</forename><surname>Šimunek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Vojtěch</forename><surname>Jirkovský</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Jan</forename><surname>Nemrava</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Jan</forename><surname>Zemánek</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">ISMIS&apos;09: 18th International Symposium on Methodologies for Intelligent Systems</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2009">2009</date>
			<biblScope unit="page" from="453" to="458" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">An XML format for association rule models based on the GUHA method</title>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kliegr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Jan</forename><surname>Rauch</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2010 International Conference on Semantic Web Rules, RuleML&apos;10</title>
				<meeting>the 2010 International Conference on Semantic Web Rules, RuleML&apos;10<address><addrLine>Berlin, Heidelberg</addrLine></address></meeting>
		<imprint>
			<publisher>Springer-Verlag</publisher>
			<date type="published" when="2010">2010</date>
			<biblScope unit="page" from="273" to="288" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">An XML schema and a topic map ontology for formalization of background knowledge in data mining</title>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kliegr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Vojtěch</forename><surname>Svátek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Milan</forename><surname>Šimůnek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Daniel</forename><surname>Štastný</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Andrej</forename><surname>Hazucha</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">IRMLeS-2010, 2nd ESWC Workshop on Inductive Reasoning and Machine Learning for the Semantic Web</title>
				<meeting><address><addrLine>Heraklion, Crete, Greece</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2010">2010</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Semantic analytical reports: A framework for post-processing of data mining results</title>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kliegr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Vojtěch</forename><surname>Svátek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Milan</forename><surname>Šimůnek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Martin</forename><surname>Ralbovský</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Intelligent Information Systems</title>
		<imprint>
			<biblScope unit="volume">37</biblScope>
			<biblScope unit="issue">3</biblScope>
			<biblScope unit="page" from="371" to="395" />
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Background knowledge and PMML: first considerations</title>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kliegr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Stanislav</forename><surname>Vojíř</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Jan</forename><surname>Rauch</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2011 workshop on Predictive markup language modeling, PMML &apos;11</title>
				<meeting>the 2011 workshop on Predictive markup language modeling, PMML &apos;11<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2011">2011</date>
			<biblScope unit="page" from="54" to="62" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Outlier (anomaly) detection modelling in PMML</title>
		<author>
			<persName><forename type="first">Jaroslav</forename><surname>Kuchař</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Adam</forename><surname>Ashenfelter</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kliegr</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">RuleML 2017 Poster and Challenge Proceedings</title>
				<imprint>
			<publisher>CEUR-WS</publisher>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Spotlighting anomalies using frequent patterns</title>
		<author>
			<persName><forename type="first">Jaroslav</forename><surname>Kuchař</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Vojtěch</forename><surname>Svátek</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">KDD 2017 Workshop on Anomaly Detection in Finance</title>
				<meeting><address><addrLine>Halifax, Nova Scotia, Canada</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Integrating classification and association rule mining</title>
		<author>
			<persName><forename type="first">Bing</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Wynne</forename><surname>Hsu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Yiming</forename><surname>Ma</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, KDD&apos;98</title>
				<meeting>the Fourth International Conference on Knowledge Discovery and Data Mining, KDD&apos;98</meeting>
		<imprint>
			<publisher>AAAI Press</publisher>
			<date type="published" when="1998">1998</date>
			<biblScope unit="page" from="80" to="86" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Isolation forest</title>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">T</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">M</forename><surname>Ting</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><forename type="middle">H</forename><surname>Zhou</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 8th IEEE International Conference on Data Mining (ICDM&apos;08)</title>
				<meeting>the 8th IEEE International Conference on Data Mining (ICDM&apos;08)</meeting>
		<imprint>
			<date type="published" when="2008">2008</date>
			<biblScope unit="page" from="413" to="422" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Isolationbased anomaly detection</title>
		<author>
			<persName><forename type="first">Tony</forename><surname>Fei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Kai</forename><forename type="middle">Ming</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Zhi-Hua</forename><surname>Ting</surname></persName>
		</author>
		<author>
			<persName><surname>Zhou</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">ACM Trans. Knowl. Discov. Data</title>
		<imprint>
			<biblScope unit="volume">6</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page">39</biblScope>
			<date type="published" when="2012-03">March 2012</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Using easyminer API for financial data analysis in project openbudgets</title>
		<author>
			<persName><forename type="first">Stanislav</forename><surname>Vojíř</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Jaroslav</forename><surname>Kuchař</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Václav Zeman</surname></persName>
		</author>
		<author>
			<persName><surname>Kliegr</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">RuleML 2017 Poster and Challenge Proceedings. CEUR-WS</title>
				<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
	<note>To appear</note>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Business rule learning with interactive selection of association rules</title>
		<author>
			<persName><forename type="first">Stanislav</forename><surname>Vojíř</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Přemysl</forename><surname>Václav Duben</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kliegr</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">RuleML Challenge</title>
				<imprint>
			<date type="published" when="2014">2014. 2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Transforming association rules to business rules: EasyMiner meets Drools</title>
		<author>
			<persName><forename type="first">Stanislav</forename><surname>Vojíř</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kliegr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Andrej</forename><surname>Hazucha</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Radek</forename><surname>Skrabal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Milan</forename><surname>Šimůnek</surname></persName>
		</author>
		<ptr target="WS.org" />
	</analytic>
	<monogr>
		<title level="m">RuleML-2013 Challenge</title>
		<title level="s">CEUR Workshop Proceedings. CEUR-</title>
		<editor>
			<persName><forename type="first">Davide</forename><surname>Ica Palmirani</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Francois</forename><surname>Sottara</surname></persName>
		</editor>
		<editor>
			<persName><surname>Lévy</surname></persName>
		</editor>
		<imprint>
			<date type="published" when="1004">1004. 2013</date>
		</imprint>
	</monogr>
	<note>Mon</note>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Easyminer/R preview: Towards a web interface for association rule learning and classification in R</title>
		<author>
			<persName><forename type="first">Stanislav</forename><surname>Vojíř</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Jaroslav</forename><surname>Václav Zeman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kuchař</surname></persName>
		</author>
		<author>
			<persName><surname>Kliegr</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Challenge+ DC@ RuleML</title>
				<imprint>
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Association rule mining following the web search paradigm</title>
		<author>
			<persName><forename type="first">Radek</forename><surname>Škrabal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Milan</forename><surname>Šimůnek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Stanislav</forename><surname>Vojíř</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Andrej</forename><surname>Hazucha</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Marek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">David</forename><surname>Chudán</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kliegr</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Machine Learning and Knowledge Discovery in Databases</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<editor>
			<persName><forename type="first">Peter</forename><forename type="middle">A</forename><surname>Flach</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Tijl</forename><surname>Bie</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Nello</forename><surname>Cristianini</surname></persName>
		</editor>
		<meeting><address><addrLine>Berlin Heidelberg</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2012">2012</date>
			<biblScope unit="volume">7524</biblScope>
			<biblScope unit="page" from="808" to="811" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">Analýza cloudového řešení akademického nástroje pro dolování pravidel z databází</title>
		<author>
			<persName><surname>Václav Zeman</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Systémová Integrace</title>
		<imprint>
			<biblScope unit="volume">23</biblScope>
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">Využití cloudu pro dolování asociačních pravidel z velkých dat přes webové rozhraní</title>
		<author>
			<persName><forename type="first">Stanislav</forename><surname>Václav Zeman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Jaroslav</forename><surname>Vojíř</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tomáš</forename><surname>Kuchař</surname></persName>
		</author>
		<author>
			<persName><surname>Kliegr</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">WIKT/DaZ</title>
		<imprint>
			<date type="published" when="2016">2016. 2016</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
