This HTML5 document contains 22 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n8https://kar.kent.ac.uk/90198/
n2https://kar.kent.ac.uk/id/eprint/
wdrshttp://www.w3.org/2007/05/powder-s#
n16http://purl.org/ontology/bibo/status/
n18https://kar.kent.ac.uk/id/subject/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n11https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/
n17http://eprints.org/ontology/
bibohttp://purl.org/ontology/bibo/
n13https://kar.kent.ac.uk/id/eprint/90198#
n10https://kar.kent.ac.uk/id/publication/
n19https://kar.kent.ac.uk/id/org/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n15doi:10.1016/
owlhttp://www.w3.org/2002/07/owl#
n12https://kar.kent.ac.uk/id/
xsdhhttp://www.w3.org/2001/XMLSchema#
n5https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/
n6https://kar.kent.ac.uk/id/person/

Statements

Subject Item
n2:90198
rdf:type
bibo:Article n17:ArticleEPrint n17:EPrint bibo:AcademicArticle
rdfs:seeAlso
n8:
owl:sameAs
n15:j.asoc.2019.01.028
dcterms:title
A distance-type-insensitive clustering approach
wdrs:describedby
n5:export_kar_RDFN3.n3 n11:export_kar_RDFN3.n3
dcterms:date
2019-04-01
dcterms:creator
n6:ext-x.gu@kent.ac.uk n6:ext-d11313d524221aba08988a86779ab4cd n6:ext-064bb967d110ccad488baa2020c708a8
bibo:status
n16:peerReviewed n16:published
dcterms:publisher
n19:ext-f308aad1ef8f70546c3a197f104f2ad5
bibo:abstract
In this paper, we offer a method aiming to minimize the role of distance metric used in clustering. It is well known that distance metrics used in clustering algorithms heavily influence the end results and also make the algorithms sensitive to imbalanced attribute/feature scales. To solve these problems, a new clustering algorithm using a per-attribute/feature ranking operating mechanism is proposed in this paper. Ranking is a rarely used discrete, nonlinear operator by other clustering algorithms. However, it also has unique advantages over the dominantly used continuous operators. The proposed algorithm is based on the ranks of the data samples in terms of their spatial separation and is able to provide a more objective clustering result compared with the alternative approaches. Numerical examples on benchmark datasets prove the validity and effectiveness of the proposed concept and principles.
dcterms:isPartOf
n10:ext-15684946 n12:repository
dcterms:subject
n18:QA75
bibo:authorList
n13:authors
bibo:volume
77