Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Relational data mining
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
'''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<!-- minor weasel words follow but left as a prompt in case some one can add actual information:, and so on-->. 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}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:Database-stub
(
edit
)
Template:Reflist
(
edit
)