Parallel computation in finding near neighbourhoods

DOI10.1007/978-3-642-24425-4_67MaRDI QIDQ3094072zbMATH OpenOpenAlexFDO

Authors Christopher J. Henry, Sheela Ramanna

Publication date 21 October 2011

Published in Rough Sets and Knowledge Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24425-4_67

zbMATH Keywords

CUDAGPUtolerance relationtolerance spacepre-classtolerance classnear setstolerance near sets

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Knowledge representation (68T30) Computing methodologies for image processing (68U10) Parallel algorithms in computer science (68W10) Proximity structures and generalizations (54E05)

Recommendations

• Maximal clique enumeration in finding near neighbourhoods
• An Improved Parallel Method for Computing Rough Set Approximations
• A descriptive tolerance nearness measure for performing graph comparison
• Perception‐based image classification
• Near tolerance rough sets

Cited in

(4)

• Maximal clique enumeration in finding near neighbourhoods
• Parallel algorithms for nearest neighbor search problems in high dimensions
• Signature-based perceptual nearness: application of near sets to image retrieval
• On the nearness measures of near sets

This page was built for publication: Parallel computation in finding near neighbourhoods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3094072)