Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
Journal of Computational and Applied Mathematics
ACM Computing Surveys (CSUR)
Queue - Databases
Cross-relational clustering with user's guidance
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
A probabilistic framework for relational clustering
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
A Two-Stage Clustering Algorithm for Multi-type Relational Data
SNPD '08 Proceedings of the 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Relational Database Design and Implementation, Third Edition: Clearly Explained 3e
Relational Database Design and Implementation, Third Edition: Clearly Explained 3e
Introducing affective agents in recommendation systems based on relational data clustering
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hi-index | 0.00 |
A wide range of the database systems in use today are based on the relational model. As a consequence, more information used by those systems has been stored in multi relational object types. However, most of the traditional machine learning algorithms have not been originally proposed to handle this type of data. Aiming to propose better ways of handling the relational particularities of the data, this paper proposes a new relational clustering method based on relationship and attribute information. In our method, attributes have weights associated with their importance between the object types. An empirical analysis is performed in order to evaluate the effectiveness of the proposed method, comparing with two traditional methods for relational clustering. Three relational databases were used in the experiments.