Maximal clique enumeration in finding near neighbourhoods
T. Rough Sets(2013)
摘要
The problem considered in this article stems from the observation that practical applications of near set theory require efficient determination of all the tolerance classes containing objects from the union of two disjoints sets. Near set theory consists in extracting perceptually relevant information from groups of objects based on their descriptions. Tolerance classes are sets where all the pairs of objects within a set must satisfy the tolerance relation and the set is maximal with respect to inclusion. Finding such classes is a computationally complex problem, especially in the case of large data sets or sets of objects with similar features. The contributions of this article are the observation that the problem of finding tolerance classes is equivalent to the MCE problem, empirical evidence verifying the conjecture from [15] that the extra perceptual information obtained by finding all tolerance classes on a set of objects obtained from a pair of images improves the CBIR results when using the tolerance nearness measure, and a new application of MCE to CBIR.
更多查看译文
关键词
cbir result,mce problem,large data set,maximal clique enumeration,set theory,tolerance relation,computationally complex problem,tolerance class,disjoints set,near set theory,tolerance nearness measure
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络