<?xml version="1.0" encoding="UTF-8"?>
<XML><RECORDS>
<RECORD>
	<REFERENCE_TYPE>3</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Kurt Jacobson</AUTHOR>
		<AUTHOR>Mark Sandler</AUTHOR>
	</AUTHORS>
	<YEAR>2009</YEAR>
	<TITLE>Interacting With Linked Data About Music</TITLE>
	<SECONDARY_TITLE>Web Science</SECONDARY_TITLE>
	<PLACE_PUBLISHED>Athens, Greece</PLACE_PUBLISHED>
	<PUBLISHER>WSRI</PUBLISHER>
	<VOLUME>1</VOLUME>
	<EDITION>1</EDITION>
	<DATE>17/03/2009</DATE>
	<ABSTRACT>In an effort to move towards intuitive visual interfaces for faceted browsing of structured data about music, we develop a visualization technique called k-pie}.  Derived from a network visualization technique know as $k$-cores decomposition, k-pie layout accounts for the semantic labels or `colors' associated with each vertex.  Vertices of a graph are arranged in a 2 dimensional circle where `slices' in the circle correspond to a specific vertex label and the most connected vertices are found in the center of the visualization.  We describe the k-pie algorithm and demonstrate how it can be useful in the context of Semantic Web technologies.  </ABSTRACT>
	<URL>http://journal.webscience.org/110/</URL>
</RECORD>
</RECORDS></XML>