Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   present a new approach for clustering a data set for which the only information available is a similarity measure beten every pair of elements. The objective is to partition the set into disjoint subsets such that two elements assigned to the same subset are more likely to have a high similarity measure than elements assigned to different subsets. The algorithm makes no assumption about the size or number of clusters, or of any constraint in the similarity measure. The algorithm relies on very simple operations. The running time is dominated by matrix multiplication, and in some cases curve-fitting.  will present experimental results from various implementations of this method.
['Javed A. Aslam', 'Alain Leblanc', 'Clifford Stein']
I am writing a research paper on a idea Clustering Data without Prior Knowledge
[{"from": "human", "value": "I am writing a research paper on a idea Clustering Data without Prior Knowledge"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   present a new approach for clustering a data set for which the only information available is a similarity measure beten every pair of elements. The objective is to partition the set into disjoint subsets such that two elements assigned to the same subset are more likely to have a high similarity measure than elements assigned to different subsets. The algorithm makes no assumption about the size or number of clusters, or of any constraint in the similarity measure. The algorithm relies on very simple operations. The running time is dominated by matrix multiplication, and in some cases curve-fitting.  will present experimental results from various implementations of this method."}]