An Introduction to Proximity Graphs

Mathieson, L; Moscato, P

An Introduction to Proximity Graphs

Mathieson, L

Moscato, P

Permalink

Publisher:: Springer International Publishing
Publication Type:: Chapter
Citation:: Business and Consumer Analytics: New Ideas, 2019, pp. 213 - 233
Issue Date:: 2019-01-01

Closed Access

	Filename	Description	Size
	2019_Book_BusinessAndConsumerAnalyticsNe.pdf	Published version	42.79 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Mathieson, L https://orcid.org/0000-0001-6470-2296	en_US
dc.contributor.author	Moscato, P	en_US
dc.contributor.editor	Moscato, P	en_US
dc.contributor.editor	de Vries, NJ	en_US
dc.date.issued	2019-01-01	en_US
dc.identifier.citation	Business and Consumer Analytics: New Ideas, 2019, pp. 213 - 233	en_US
dc.identifier.isbn	978-3-030-06221-7	en_US
dc.identifier.uri	http://hdl.handle.net/10453/137885
dc.description.abstract	Proximity graphs are one of the combinatorial data-miner’s frontline tools. They allow expression of complex proximity relationships and are the basis of many other algorithms. Here we introduce the concept of proximity graphs, present basic definitions and discuss some of the most common types of proximity graphs.	en_US
dc.publisher	Springer International Publishing	en_US
dc.relation.ispartof	Business and Consumer Analytics: New Ideas	en_US
dc.relation.isbasedon	10.1007/978-3-030-06222-4_4	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	An Introduction to Proximity Graphs	en_US
dc.type	Chapter
utslib.location	Germany	en_US
utslib.for	0803 Computer Software	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
utslib.copyright.status	closed_access	*
pubs.consider-herdc	false	en_US
pubs.place-of-publication	Germany	en_US
pubs.publication-status	Published	en_US

Abstract:

Proximity graphs are one of the combinatorial data-miner’s frontline tools. They allow expression of complex proximity relationships and are the basis of many other algorithms. Here we introduce the concept of proximity graphs, present basic definitions and discuss some of the most common types of proximity graphs.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/137885