Calculating distance measure for clustering in multi-relational settings

author: Olegas Niaksu, Institute of Mathematics and Informatics, Vilnius University
published: Oct. 30, 2013,   recorded: October 2013,   views: 1768
Categories

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

Description

The paper deals with a distance based multi-relational clustering application in a real data case study. A novel method for a dissimilarity matrix calculation in multi-relational settings has been proposed and implemented in R language. The proposed method has been tested by analyzing public actions related to data mining subject and indexed in the medical index database MedLine. Clustering based on partitioning around methods was used for the semi-automated identification of the most popular topics among the MedLine publications. The algorithm implements greedy approach and is suitable for small data sets with a limited number of 1:n relational joins.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: