Not logged in : Login
(Sponging disallowed)

About: A method for autonomous data partitioning     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : bibo:AcademicArticle, within Data Space : demo.openlinksw.com associated with source document(s)

AttributesValues
type
seeAlso
sameAs
Title
  • A method for autonomous data partitioning
described by
Date
  • 2018-09-01
Creator
status
Publisher
abstract
  • In this paper, we propose a fully autonomous, local-modes-based data partitioning algorithm, which is able to automatically recognize local maxima of the data density from empirical observations and use them as focal points to form shape-free data clouds, i.e. a form of Voronoi tessellation. The method is free from user- and problem- specific parameters and prior assumptions. The proposed algorithm has two versions: i) offline for static data and ii) evolving for streaming data. Numerical results based on benchmark datasets prove the validity of the proposed algorithm and demonstrate its excellent performance and high computational efficiency compared with the state-of-art clustering algorithms.
Is Part Of
Subject
list of authors
volume
  • 460-46
is topic of
is primary topic of
Faceted Search & Find service v1.17_git144 as of Jul 26 2024


Alternative Linked Data Documents: iSPARQL | ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3331 as of Aug 25 2024, on Linux (x86_64-ubuntu_noble-linux-glibc2.38-64), Single-Server Edition (378 GB total memory, 54 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software