Maximal clique enumeration in finding near neighbourhoods

摘要: The problem considered in this article stems from the observation that practical applications of near set theory require efficient determination all tolerance classes containing objects union two disjoints sets. Near consists extracting perceptually relevant information groups based on their descriptions. Tolerance are sets where pairs within a must satisfy relation and is maximal with respect to inclusion. Finding such computationally complex problem, especially case large data or similar features. contributions finding equivalent MCE empirical evidence verifying conjecture [15] extra perceptual obtained by pair images improves CBIR results when using nearness measure, new application CBIR.