Open Access
- 16 March 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 944-948
Abstract
The amount of data collected and stored in databases is growing considerably in almost all areas of human activity. In complex applications the data involves several relations and proposionalization is not a suitable approach. Multi-Relational Data Mining algorithms can analyze data from multiple relations, with no need to transform the data into a single table, but are computationally more expensive. In this paper a novel relational classification algorithm based on the k-nearest neighbour algorithm is presented and evaluatedKeywords
Funding Information
- Fundação para a Ciência e a Tecnologia (SFRH/BPD/26737/2006)
This publication has 5 references indexed in Scilit:
- Propositionalization-based relational subgroup discovery with RSDMachine Learning, 2006
- An Integrated Approach to Learning Bayesian Networks of RulesLecture Notes in Computer Science, 2005
- Kernels and Distances for Structured DataMachine Learning, 2004
- A Support-Ordered Trie for Fast Frequent Itemset DiscoveryIEEE Transactions on Knowledge and Data Engineering, 2004
- Learning Relations from Noisy Examples: An Empirical Comparison of LINUS and FOIL1991