On Lower Bounds for the Number of Queries in Clustering Algorithms
Abstract: We consider clustering with the help of an oracle when all queries are made at once and the clusters are determined after all the responses are received. We determine the minimum number of queries required to completely cluster all items. We also consider active clustering with the help of an oracle when a number of queries are made in the first round and the remaining queries are made in the second round based upon the responses to the queries from the first round. We determine a lower bound for the number of queries required to completely cluster all items based upon an analysis of the number of queries made in the first round.
Submission Length: Regular submission (no more than 12 pages of main content)
Assigned Action Editor: ~Nihar_B_Shah1
Submission Number: 1239
Loading