Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The results returned by a search, datamining or database engine often contains an overload of potentially interesting information. A daunting and challenging problem for a user is to pick out the useful information.   propose an interactive framework to efficiently explore and (re)rank the objects retrieved by such an engine, according to feedback provided on part of the initially retrieved objects. In particular, given a set of objects, a similarity measure applicable to the objects and an initial set of objects that are of interest to the user, our algorithm computes the k most similar objects. This problem, previously coined as 'cluster on demand' [10], is solved by transforming the data into a ighted graph. On this ighted graph  compute a relevance score beten the initial set of nodes and the remaining nodes based upon random walks with restart in graphs. apply our algorithm "Tell Me More" (TMM) on text, numerical and zero/one data. The results show that TMM for almost every experiment significantly outperforms a k-nearest neighbor approach.
['Jeroen De Knijf', 'Anthony M. L. Liekens', 'Bart Goethals']
I am writing a research paper on a idea Tell me more: finding related items from user provided feedback
[{"from": "human", "value": "I am writing a research paper on a idea Tell me more: finding related items from user provided feedback"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The results returned by a search, datamining or database engine often contains an overload of potentially interesting information. A daunting and challenging problem for a user is to pick out the useful information.   propose an interactive framework to efficiently explore and (re)rank the objects retrieved by such an engine, according to feedback provided on part of the initially retrieved objects. In particular, given a set of objects, a similarity measure applicable to the objects and an initial set of objects that are of interest to the user, our algorithm computes the k most similar objects. This problem, previously coined as 'cluster on demand' [10], is solved by transforming the data into a ighted graph. On this ighted graph  compute a relevance score beten the initial set of nodes and the remaining nodes based upon random walks with restart in graphs. apply our algorithm \"Tell Me More\" (TMM) on text, numerical and zero/one data. The results show that TMM for almost every experiment significantly outperforms a k-nearest neighbor approach."}]