Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: K-means is one of the most popular clustering algorithms.  introduce an efficient disk-based implementation of K-means. The proposed algorithm is designed to work inside a relational database management system. It can cluster large data sets having very high dimensionality. In general, it only requires three scans over the data set. It is optimized to perform heavy disk I/O and its memory requirements are low. Its parameters are easy to set. An extensive experimental section evaluates quality of results and performance. The proposed algorithm is compared against the Standard K-means algorithm as ll as the Scalable K-means algorithm.
['Carlos Ordonez', 'Edward Omiecinski']
I am writing a research paper on a idea Efficient disk-based K-means clustering for relational databases
[{"from": "human", "value": "I am writing a research paper on a idea Efficient disk-based K-means clustering for relational databases"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: K-means is one of the most popular clustering algorithms.  introduce an efficient disk-based implementation of K-means. The proposed algorithm is designed to work inside a relational database management system. It can cluster large data sets having very high dimensionality. In general, it only requires three scans over the data set. It is optimized to perform heavy disk I/O and its memory requirements are low. Its parameters are easy to set. An extensive experimental section evaluates quality of results and performance. The proposed algorithm is compared against the Standard K-means algorithm as ll as the Scalable K-means algorithm."}]