This HTML5 document contains 28 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/
n6https://kar.kent.ac.uk/92827/
n8doi:10.1002/
n2https://kar.kent.ac.uk/id/eprint/
wdrshttp://www.w3.org/2007/05/powder-s#
n17http://purl.org/ontology/bibo/status/
dchttp://purl.org/dc/elements/1.1/
n11https://kar.kent.ac.uk/id/subject/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n21https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/
n3http://eprints.org/ontology/
bibohttp://purl.org/ontology/bibo/
n19https://kar.kent.ac.uk/id/publication/
n10https://kar.kent.ac.uk/id/org/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n4https://kar.kent.ac.uk/id/document/
n18https://kar.kent.ac.uk/id/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20https://kar.kent.ac.uk/id/eprint/92827#
n14https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/
n12https://kar.kent.ac.uk/id/person/

Statements

Subject Item
n2:92827
rdf:type
n3:ArticleEPrint bibo:Article n3:EPrint bibo:AcademicArticle
rdfs:seeAlso
n6:
owl:sameAs
n8:int.22809
n3:hasAccepted
n4:3260613
n3:hasDocument
n4:3260701 n4:3260704 n4:3260702 n4:3260703 n4:3260613 n4:3260700
dc:hasVersion
n4:3260613
dcterms:title
Data stream classification with ant colony optimisation
wdrs:describedby
n14:export_kar_RDFN3.n3 n21:export_kar_RDFN3.n3
dcterms:date
2022-01-10
dcterms:creator
n12:ext-f.e.b.otero@kent.ac.uk n12:ext-amh58@kent.ac.uk
bibo:status
n17:peerReviewed n17:published
dcterms:publisher
n10:ext-e7795bc59c66fd1972aa29b4459edb20
bibo:abstract
Data stream mining has recently emerged in response to the rapidly increasing continuous data generation. While the majority of Ant Colony Optimisation (ACO) rule induction algorithms have proved to be successful in producing both accurate and comprehensive classification models in nonstreaming (batch) settings, currently ACO-based algorithms for classification problems are not suited to be applied to data stream mining. One of the main challenges is the iterative nature of ACO algorithms, where many procedures—for example, heuristic calculation, selection of continuous attributes, pruning—require multiple passes through the data to create a model. In this paper, we present a new ACO-based algorithm for data stream classification. The proposed algorithm, called Stream Ant-Miner (sAnt-Miner), uses a novel hybrid pheromone model combining both a traditional construction graph and solution archives models to efficiently handle a large number of mixed-type (nominal and continuous) attributes directly without the need for additional procedures, reducing the computational time required to complete an iteration of the algorithm. Our results show that sAnt-Miner produces statistically significant concise models compared with state-of-the-art rule induction data stream algorithms, without negative effects on their predictive accuracy.
dcterms:isPartOf
n18:repository n19:ext-08848173
dcterms:subject
n11:Q335
bibo:authorList
n20:authors