Approximate clustering in very large relational data

DOI10.1002/INT.20162zbMATH Open1107.68078OpenAlexW2112082806MaRDI QIDQ3422161FDOQ3422161

Authors: James C. Bezdek, Richard J. Hathaway, Christopher Leckie, Ramamohanarao Kotagiri, J. Huband 

Publication date: 9 February 2007

Published in: International Journal of Intelligent Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/int.20162

Recommendations

• Selective sampling for approximate clustering of very large data sets
• Extending fuzzy and probabilistic clustering to very large data sets
• Relational duals of the c-means clustering algorithms
• scientific article; zbMATH DE number 4082763
• Kernelized non-Euclidean relational c-means algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• Extending fuzzy and probabilistic clustering to very large data sets

Cited In (8)

• Handling very large cooccurrence matrices in fuzzy co-clustering by sampling approaches
• Fuzzy clustering with weighted medoids for relational data
• Kernelized non-Euclidean relational c-means algorithms
• Extending fuzzy and probabilistic clustering to very large data sets
• Speeding Up Inference in Statistical Relational Learning by Clustering Similar Query Literals
• Title not available (Why is that?)
• Scalable visual assessment of cluster tendency for large data sets
• Approximate correlation clustering using same-cluster queries

This page was built for publication: Approximate clustering in very large relational data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3422161)