Home > Research > Publications & Outputs > DEC

Links

Text available via DOI:

View graph of relations

DEC: dynamically evolving clustering autonomous and its application to structure

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

DEC: dynamically evolving clustering autonomous and its application to structure. / Dutta Baruah, Rashmi; Angelov, Plamen.
In: IEEE Transactions on Cybernetics, Vol. 44, No. 9, 14.08.2014, p. 1619-1631.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Dutta Baruah, R & Angelov, P 2014, 'DEC: dynamically evolving clustering autonomous and its application to structure', IEEE Transactions on Cybernetics, vol. 44, no. 9, pp. 1619-1631. https://doi.org/10.1109/TCYB.2013.2291234

APA

Vancouver

Dutta Baruah R, Angelov P. DEC: dynamically evolving clustering autonomous and its application to structure. IEEE Transactions on Cybernetics. 2014 Aug 14;44(9):1619-1631. Epub 2013 Dec 2. doi: 10.1109/TCYB.2013.2291234

Author

Dutta Baruah, Rashmi ; Angelov, Plamen. / DEC : dynamically evolving clustering autonomous and its application to structure. In: IEEE Transactions on Cybernetics. 2014 ; Vol. 44, No. 9. pp. 1619-1631.

Bibtex

@article{b942bc99635c48269b8a9f1c8fa56bd3,
title = "DEC: dynamically evolving clustering autonomous and its application to structure",
abstract = "Identification of models from input-output data essentially requires estimation of appropriate cluster centers. In this paper, a new online evolving clustering approach for streaming data is proposed. Unlike other approaches that consider either the data density or distance from existing cluster centers, this approach uses cluster weight and distance before generating new clusters. To capture the dynamics of the data stream, the cluster weight is defined in both data and time space in such a way that it decays exponentially with time. It also applies concepts from computational geometry to determine the neighborhood information while forming clusters. A distinction is made between core and noncore clusters to effectively identify the real outliers. The approach efficiently estimates cluster centers upon which evolving Takagi-Sugeno models are developed. The experimental results with developed models show that the proposed approach attains results at par or better than existing approaches and significantly reduces the computational overhead, which makes it suitable for real-time applications.",
author = "{Dutta Baruah}, Rashmi and Plamen Angelov",
year = "2014",
month = aug,
day = "14",
doi = "10.1109/TCYB.2013.2291234",
language = "English",
volume = "44",
pages = "1619--1631",
journal = "IEEE Transactions on Cybernetics",
issn = "2168-2267",
publisher = "IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC",
number = "9",

}

RIS

TY - JOUR

T1 - DEC

T2 - dynamically evolving clustering autonomous and its application to structure

AU - Dutta Baruah, Rashmi

AU - Angelov, Plamen

PY - 2014/8/14

Y1 - 2014/8/14

N2 - Identification of models from input-output data essentially requires estimation of appropriate cluster centers. In this paper, a new online evolving clustering approach for streaming data is proposed. Unlike other approaches that consider either the data density or distance from existing cluster centers, this approach uses cluster weight and distance before generating new clusters. To capture the dynamics of the data stream, the cluster weight is defined in both data and time space in such a way that it decays exponentially with time. It also applies concepts from computational geometry to determine the neighborhood information while forming clusters. A distinction is made between core and noncore clusters to effectively identify the real outliers. The approach efficiently estimates cluster centers upon which evolving Takagi-Sugeno models are developed. The experimental results with developed models show that the proposed approach attains results at par or better than existing approaches and significantly reduces the computational overhead, which makes it suitable for real-time applications.

AB - Identification of models from input-output data essentially requires estimation of appropriate cluster centers. In this paper, a new online evolving clustering approach for streaming data is proposed. Unlike other approaches that consider either the data density or distance from existing cluster centers, this approach uses cluster weight and distance before generating new clusters. To capture the dynamics of the data stream, the cluster weight is defined in both data and time space in such a way that it decays exponentially with time. It also applies concepts from computational geometry to determine the neighborhood information while forming clusters. A distinction is made between core and noncore clusters to effectively identify the real outliers. The approach efficiently estimates cluster centers upon which evolving Takagi-Sugeno models are developed. The experimental results with developed models show that the proposed approach attains results at par or better than existing approaches and significantly reduces the computational overhead, which makes it suitable for real-time applications.

U2 - 10.1109/TCYB.2013.2291234

DO - 10.1109/TCYB.2013.2291234

M3 - Journal article

VL - 44

SP - 1619

EP - 1631

JO - IEEE Transactions on Cybernetics

JF - IEEE Transactions on Cybernetics

SN - 2168-2267

IS - 9

ER -