Relational data mining - Revision history

imported>A.conway20 at 11:01, 21 August 2025

2025-08-21T11:01:13Z

← Previous revision		Revision as of 11:01, 21 August 2025
Line 15:		Line 15:

	==Algorithms==		==Algorithms==
	'''Multi-Relation Association Rules''': Multi-Relation Association Rules (MRAR) is a new class of association rules which in contrast to primitive, simple and even multi-relational association rules (that are usually extracted from multi-relational databases), each rule item consists of one entity but several relations. These relations indicate indirect relationship between the entities. Consider the following MRAR where the first item consists of three relations ''live in'', ''nearby'' and ''humid'': “Those who ''live in'' a place which is ''near by'' a city with ''humid'' climate type and also are ''younger'' than 20 -> their ''health condition'' is good”. Such association rules are extractable from RDBMS data or semantic web data.<ref name="MRAR: Mining Multi-Relation Association Rules">Ramezani, Reza, Mohamad Saraee, and Mohammad Ali Nematbakhsh; ''[~~http~~://~~usir.~~salford.ac.~~uk/id/eprint~~/~~42504~~/1/~~MRAR_Saraee.pdf~~ MRAR: Mining Multi-Relation Association Rules]'', Journal of Computing and Security, 1, no. 2 (2014)</ref>		'''Multi-Relation Association Rules''': Multi-Relation Association Rules (MRAR) is a new class of association rules which in contrast to primitive, simple and even multi-relational association rules (that are usually extracted from multi-relational databases), each rule item consists of one entity but several relations. These relations indicate indirect relationship between the entities. Consider the following MRAR where the first item consists of three relations ''live in'', ''nearby'' and ''humid'': “Those who ''live in'' a place which is ''near by'' a city with ''humid'' climate type and also are ''younger'' than 20 -> their ''health condition'' is good”. Such association rules are extractable from RDBMS data or semantic web data.<ref name="MRAR: Mining Multi-Relation Association Rules">Ramezani, Reza, Mohamad Saraee, and Mohammad Ali Nematbakhsh; ''[https://salford-repository.worktribe.com/output/1391135/mrar-mining-multi-relation-association-rules MRAR: Mining Multi-Relation Association Rules]'', Journal of Computing and Security, 1, no. 2 (2014)</ref>

	==Software==		==Software==

imported>Fadesga: /* External links */

2025-06-25T19:43:39Z

External links

← Previous revision		Revision as of 19:43, 25 June 2025
Line 42:		Line 42:

	{{database-stub}}		{{database-stub}}
			{{machine-learning-stub}}

imported>David Eppstein: Nada Lavrač

2024-01-15T00:03:27Z

Nada Lavrač

New page

'''Relational data mining''' is the [[data mining]] technique for relational
databases.<ref>Dzeroski, Saso, [[Nada Lavrač|Lavrač, Nada]] (Eds.), Relational Data Mining, Springer 2001 [https://www.springer.com/computer/database+management+%26+information+retrieval/book/978-3-540-42289-1]</ref> Unlike traditional data mining algorithms, which look for
patterns in a single table ([[propositional patterns]]),
relational data mining algorithms look for patterns among multiple tables
([[relational patterns]]). For most types of propositional
patterns, there are corresponding relational patterns. For example,
there are relational [[classification rule]]s ('''relational classification'''), relational [[Decision tree learning|regression tree]], and relational [[association rule]]s.

There are several approaches to relational data mining:
# [[Inductive_logic_programming|Inductive Logic Programming]] (ILP)
# [[Statistical_relational_learning|Statistical Relational Learning]] (SRL)
# [[Structure mining|Graph Mining]]
# Propositionalization
# Multi-view learning

==Algorithms==
'''Multi-Relation Association Rules''': Multi-Relation Association Rules (MRAR) is a new class of association rules which in contrast to primitive, simple and even multi-relational association rules (that are usually extracted from multi-relational databases), each rule item consists of one entity but several relations. These relations indicate indirect relationship between the entities. Consider the following MRAR where the first item consists of three relations ''live in'', ''nearby'' and ''humid'': “Those who ''live in'' a place which is ''near by'' a city with ''humid'' climate type and also are ''younger'' than 20 -> their ''health condition'' is good”. Such association rules are extractable from RDBMS data or semantic web data.<ref name="MRAR: Mining Multi-Relation Association Rules">Ramezani, Reza, Mohamad Saraee, and Mohammad Ali Nematbakhsh; ''[http://usir.salford.ac.uk/id/eprint/42504/1/MRAR_Saraee.pdf MRAR: Mining Multi-Relation Association Rules]'', Journal of Computing and Security, 1, no. 2 (2014)</ref>

==Software==
* [http://www.kiminkii.com/safarii.html Safarii]: a Data Mining environment for analysing large relational databases based on a multi-relational data mining engine.
* [http://www.dataconda.net Dataconda]: a software, free for research and teaching purposes, that helps mining relational databases without the use of SQL.

==Datasets==
* [http://relational.fit.cvut.cz Relational dataset repository]: a collection of publicly available relational datasets.

==See also==
*[[Data mining]]
*[[Structure mining]]
*[[Database mining]]

==References==
{{Reflist}}

== External links ==
* [http://www-ai.ijs.si/SasoDzeroski/RDMBook/ Web page for a text book on relational data mining]

[[Category:Machine learning]]
[[Category:Data processing]]
[[Category:Relational model]]

{{database-stub}}