Rk-means: Fast Clustering for Relational Data
RelationalAI
02 January 2020
less than a minute read
Rk-means: Fast Clustering for Relational Data
This work expanded the class of ML models one can train relationally to some unsupervised models.
Authors: Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich. 2020.
In Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics (AISTATS ‘20).
Conventional machine learning algorithms cannot be applied until a data matrix is available to process. When the data matrix needs to be obtained from a relational database via a feature extraction query, the computation cost can be prohibitive, as the data matrix may be (much) larger than the total input relation size. This paper introduces Rk-means, or relationalk-means algorithm, for clustering relational data tuples without having to access the full data matrix.
Related Posts
Deep Learning with Relations, NeurIPS 2021
Molham shares some history of relational databases, trends in modern cloud-native database systems, and the innovations pioneered at RelationalAI to bring deep learning with relations from idea to reality.
Read More
AI workloads inside databases, NeurIPS 2021
This incredible panel of experts gathered to discuss the current state of AI and machine learning workloads inside databases. The panel discussed new techniques, technologies, and recent papers that progress our understanding of what is possible. Q&A among the panel and from the audience concludes this deep and wide ranging conversation.
Read More
Machine Learning through Database Glasses, NeurIPS 2021
This talk explores several techniques to improve the runtime performance of machine learning by taking advantage of the underlying structure of relational data. While most data scientists use relational data in their work, the data science tooling that works with relational data is quite lacking today. Let’s explore these new techniques and see how we can drastically improve machine learning through a database-oriented lens.
Read More