Efficiently computing weighted proximity relationships in spatial databases

DOI10.1007/3-540-47714-4_26MaRDI QIDQ4778744zbMATH OpenFDO

Authors Xuemin Lin, Xiao-Mei Zhou, Chengfei Liu, Xiaofang Zhou

Publication date 19 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2118/21180279

zbMATH Keywords

data miningspatial query processing

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Computing methodologies and applications (68U99)

Recommendations

• Efficient computation of a proximity matching in spatial databases
• Robust distance-based clustering with applications to spatial data mining
• Approaches for scaling DBSCAN algorithm to large spatial databases
• Criteria on proximity graphs for boundary extraction and spatial clustering
• A relational perspective on spatial data mining

Cited in

(3)

• Proximity Search with a Triangulated Spatial Model
• Efficient computation of a proximity matching in spatial databases
• Weighted Relational Models for Mobility

This page was built for publication: Efficiently computing weighted proximity relationships in spatial databases

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