Maximal Clique Enumeration in Finding Near Neighbourhoods

DOI10.1007/978-3-642-36505-8_7zbMath1377.68305OpenAlexW67670335MaRDI QIDQ4909593

Christopher J. Henry, Sheela Ramanna

Publication date: 21 March 2013

Published in: Transactions on Rough Sets XVI (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36505-8_7

zbMATH Keywords

tolerance relationtolerance spaceCBIRmaximal clique enumerationnearness measurepre-classnear setstolerance near sets

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Reasoning under uncertainty in the context of artificial intelligence (68T37) Topological spaces and generalizations (closure spaces, etc.) (54A05) Proximity structures and generalizations (54E05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Information storage and retrieval of data (68P20)

Related Items (1)

Metric free nearness measure using description-based neighbourhoods

This page was built for publication: Maximal Clique Enumeration in Finding Near Neighbourhoods