Bibliometric Survey on Incremental Clustering Algorithms

For clustering accuracy, on influx of data, the parameter-free incremental clustering research is essential. The sole purpose of this bibliometric analysis is to understand the reach and utility of incremental clustering algorithms. This paper shows incremental clustering for time series dataset was...

Full description

Saved in:
Bibliographic Details
Published in:Library philosophy and practice pp. 1 - 23
Main Authors: Chaudhari, Archana, Joshi, Rahul Raghvendra, Mulay, Preeti, Kotecha, Ketan, Kulkarni, Parag
Format: Journal Article
Language:English
Published: Lincoln Library Philosophy and Practice 01.09.2019
Subjects:
ISSN:1522-0222
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract For clustering accuracy, on influx of data, the parameter-free incremental clustering research is essential. The sole purpose of this bibliometric analysis is to understand the reach and utility of incremental clustering algorithms. This paper shows incremental clustering for time series dataset was first explored in 2000 and continued thereafter till date. This Bibliometric analysis is done using Scopus, Google Scholar, Research Gate, and the tools like Gephi, Table2Net, and GPS Visualizer etc. The survey revealed that maximum publications of incremental clustering algorithms are from conference and journals, affiliated to Computer Science, Chinese lead publications followed by India then United States. Convergence optimality is another prominent keyword and less attentiveness towards correlation has observed. For betweenness and friendly measures keywords, after physics and astronomy; engineering is the contributing subject area, minimal contribution of review papers are observed in this art-search. The effectual incremental learning is feasible via parameter-free incremental clustering algorithm, applicable to all domains and hence this study.
AbstractList For clustering accuracy, on influx of data, the parameter-free incremental clustering research is essential. The sole purpose of this bibliometric analysis is to understand the reach and utility of incremental clustering algorithms. This paper shows incremental clustering for time series dataset was first explored in 2000 and continued thereafter till date. This Bibliometric analysis is done using Scopus, Google Scholar, Research Gate, and the tools like Gephi, Table2Net, and GPS Visualizer etc. The survey revealed that maximum publications of incremental clustering algorithms are from conference and journals, affiliated to Computer Science, Chinese lead publications followed by India then United States. Convergence optimality is another prominent keyword and less attentiveness towards correlation has observed. For betweenness and friendly measures keywords, after physics and astronomy; engineering is the contributing subject area, minimal contribution of review papers are observed in this art-search. The effectual incremental learning is feasible via parameter-free incremental clustering algorithm, applicable to all domains and hence this study.
Author Mulay, Preeti
Kotecha, Ketan
Kulkarni, Parag
Joshi, Rahul Raghvendra
Chaudhari, Archana
Author_xml – sequence: 1
  givenname: Archana
  surname: Chaudhari
  fullname: Chaudhari, Archana
– sequence: 2
  givenname: Rahul
  surname: Joshi
  middlename: Raghvendra
  fullname: Joshi, Rahul Raghvendra
– sequence: 3
  givenname: Preeti
  surname: Mulay
  fullname: Mulay, Preeti
– sequence: 4
  givenname: Ketan
  surname: Kotecha
  fullname: Kotecha, Ketan
– sequence: 5
  givenname: Parag
  surname: Kulkarni
  fullname: Kulkarni, Parag
BookMark eNotzctKAzEUgOEgCrbVdwi4HkjOyWSSZR28FAou7L5MLlOnZJKaZATfXkFX_-771-Q6puivyIq3AA0DgFuyLuXMGCAyXBH1OJkwpdnXPFn6vuQv_01TpLtos599rEOgfVhK9XmKJ7oNp5Sn-jGXO3IzDqH4-_9uyOH56dC_Nvu3l12_3TcXrWpj0HPptNRowGrB0YnBo2Fc6M4pJ81grFC2FWPnQOHYSqeskxalHAE4ww15-GMvOX0uvtTjOS05_h6PAFp3Ejnv8Ac_oENe
ContentType Journal Article
Copyright 2019. This work is published under NOCC (the “License†). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2019. This work is published under NOCC (the “License†). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 3V.
7XB
8FK
8G5
ABUWG
AFKRA
ALSLI
AZQEC
BENPR
CCPQU
CNYFK
DWQXO
E3H
F2A
GNUQQ
GUQSH
M1O
M2O
MBDVC
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
PRQQA
Q9U
DatabaseName ProQuest Central (Corporate)
ProQuest Central (purchase pre-March 2016)
ProQuest Central (Alumni) (purchase pre-March 2016)
Research Library (Alumni)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Social Science Premium Collection
ProQuest Central Essentials - QC
ProQuest Central
ProQuest One
Library & Information Science Collection
ProQuest Central
Library & Information Sciences Abstracts (LISA)
Library & Information Science Abstracts (LISA)
ProQuest Central Student
ProQuest Research Library
Library Science Database
ProQuest Research Library
Research Library (Corporate)
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest One Social Sciences
ProQuest Central Basic
DatabaseTitle Publicly Available Content Database
Social Science Premium Collection
Research Library Prep
ProQuest One Social Sciences
ProQuest Central Student
ProQuest One Academic Middle East (New)
ProQuest Central Basic
Library and Information Science Abstracts (LISA)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
ProQuest One Community College
Research Library (Alumni Edition)
ProQuest Central China
ProQuest Central
ProQuest Library Science
ProQuest One Academic UKI Edition
ProQuest Central Korea
Library & Information Science Collection
ProQuest Research Library
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
ProQuest Central (Alumni)
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Library & Information Science
Physics
Computer Science
EISSN 1522-0222
EndPage 23
GeographicLocations United States--US
GeographicLocations_xml – name: United States--US
GroupedDBID .4I
1XV
29L
2WC
3V.
5GY
77I
7XB
8FK
8G5
8R4
8R5
AAFWJ
ABDBF
ABUWG
AFFHD
AFKRA
ALMA_UNASSIGNED_HOLDINGS
ALSLI
ARB
AZQEC
BENPR
BPHCQ
CCPQU
CNYFK
DWQXO
E3H
E3Z
ELW
F2A
GNUQQ
GUQSH
IAO
IEA
IOF
IPO
ITC
M1O
M2O
MBDVC
OK1
OVT
P2P
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
PROAC
PRQQA
PV9
Q2X
Q9U
QF4
QN7
RNS
RZL
TR2
XH6
XSB
ID FETCH-LOGICAL-p98t-b3e16d9693b2c9413d4ae3b01497d8d6babc48c54f7d283f56d8cd6c366f22103
IEDL.DBID BENPR
IngestDate Tue Nov 18 03:42:24 EST 2025
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-p98t-b3e16d9693b2c9413d4ae3b01497d8d6babc48c54f7d283f56d8cd6c366f22103
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://www.proquest.com/docview/2299763117?pq-origsite=%requestingapplication%
PQID 2299763117
PQPubID 54903
PageCount 23
ParticipantIDs proquest_journals_2299763117
PublicationCentury 2000
PublicationDate 20190901
PublicationDateYYYYMMDD 2019-09-01
PublicationDate_xml – month: 09
  year: 2019
  text: 20190901
  day: 01
PublicationDecade 2010
PublicationPlace Lincoln
PublicationPlace_xml – name: Lincoln
PublicationTitle Library philosophy and practice
PublicationYear 2019
Publisher Library Philosophy and Practice
Publisher_xml – name: Library Philosophy and Practice
SSID ssj0023303
Score 2.240107
Snippet For clustering accuracy, on influx of data, the parameter-free incremental clustering research is essential. The sole purpose of this bibliometric analysis is...
SourceID proquest
SourceType Aggregation Database
StartPage 1
SubjectTerms Algorithms
Astronomy
Bibliometrics
Big Data
Citations
Clustering
Computer engineering
Computer science
Convergence
Datasets
Diabetes
Expected values
International conferences
Keywords
Knowledge management
Library and information science
Physics
Polls & surveys
Principal components analysis
Time series
Title Bibliometric Survey on Incremental Clustering Algorithms
URI https://www.proquest.com/docview/2299763117
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Library Science Database
  databaseCode: M1O
  dateStart: 20090101
  customDbUrl:
  isFulltext: true
  eissn: 1522-0222
  dateEnd: 99991231
  titleUrlDefault: https://search.proquest.com/libraryscience
  omitProxy: false
  ssIdentifier: ssj0023303
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  databaseCode: BENPR
  dateStart: 20090101
  customDbUrl:
  isFulltext: true
  eissn: 1522-0222
  dateEnd: 99991231
  titleUrlDefault: https://www.proquest.com/central
  omitProxy: false
  ssIdentifier: ssj0023303
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  databaseCode: PIMPY
  dateStart: 20090101
  customDbUrl:
  isFulltext: true
  eissn: 1522-0222
  dateEnd: 99991231
  titleUrlDefault: http://search.proquest.com/publiccontent
  omitProxy: false
  ssIdentifier: ssj0023303
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Research Library
  databaseCode: M2O
  dateStart: 20090101
  customDbUrl:
  isFulltext: true
  eissn: 1522-0222
  dateEnd: 99991231
  titleUrlDefault: https://search.proquest.com/pqrl
  omitProxy: false
  ssIdentifier: ssj0023303
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8JAEJ4IaOJFFDU-gPRgvG2kr-3uyQCB6AFslAOeCPuokiAgLST-e2fLIgcTL172sk22me188-jMfAA3ZiYUhh2CaE0pCRKhCGNCEOppGnGFNjuSOdlE1O-z4ZDHNuGW2rLKLSbmQK3m0uTI7zzETdQF143uF5_EsEaZv6uWQqMAJTOpLChCqdXpx88_IRdG6_4vlM1NR7f830OP4cg6jU5zc8snsKdnFShvCRkcq58VqNkuBOfWsW1GRuy7_YO83lOmp8BaEzE1nfdmQL_zslqu9ZeDjyJcbBKGeFx7ujJTFNC2Oc3pG75W9v6RnsGg2xm0H4glUSALzjIifO1SxSn3hSc5WiwVjLUvTGAUKaaoGAsZMBkGSaTQ00hCauiMqPQpTTwMB_1zKM7mM30BDtVSSJ6EvBF6gdQB9xKqwgg_grEQDcouoboV4sgqQjraSfDq7-1rOERfxJZvVaGYLVe6BvtynU3SZd3eax0KPffJrB6upfixF79-Azbhtlo
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3JTsMwEB1BAcGFHbHjA3CzaJ3EsQ8IsYqqiyrRA5yqegkglVKatoiP4h8Zpw4VF24cODuK5czzG48zMw_g0PWEwrBDUWs5p2GiDBVCKcqZ5bE06LNjnYlNxPW6uL-XjSn4zGthXFplzokZUZtX7e7ITxjyJu6FUik-671Rpxrl_q7mEhpjWFTsxzuGbOlp-Qrte8TYzXXz8pZ6VQHak2JAVWBL3EguA8W0RAo3YdsGykUKsRGGq7bSodBRmMQGXW8Scafvw3XAecIwPgrwtdMwEyLWRQFmGuVa4-E7wguCTHzrJ6lnnupm6Z-tcRkW_ZGYnI8xvAJTtrsKS7ncBPHsswp7vsaCHBNfROVANRmfy7JZdboG4uJZdVxfASc_QO6G_ZH9IPgokuH4OhSnu-wMXY8I9NzkvPOIX2Hw9JKuQ_MvFroBhe5r124C4VYrLZNIFiMWahtKlnATxQjxtlJFLrZgN7dZy2_ztDUx2Pbvwwcwf9usVVvVcr2yAwt46vKJartQGPSHdg9m9WjwnPb3PaQItP7YwF_H1A9e
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT8JAEJ4gqPHiAzU-UPeg3hqgj233YIygRIJpiHLg1rCPKgmi0oLxp_nvnC1biRdvHjxv0812Zr6Z2c7MB3CqZ0Jh2sEtpSi13JhLKwg4t6itqM8k-mxfZGQTfhgG_T7rFuAz74XRZZU5JmZALV-EviOv2oibaAv1ul-NTVlE97p1-fpmaQYp_ac1p9OYq0hHfbxj-pZctK9R1me23brpNW8twzBgvbIgtbij6lQyyhxuC4ZwLt2BcrjOGnwZSMoHXLiB8NzYl-iGY49qrh8qHEpjG3MlB1-7BCUfYww0rlLjJuzef2d7jpMRcf0E-MxrtTb-8Xk3Yd2EyuRqrttbUFDjMmzkNBTEoFIZjkzvBTknprlKK9tifSWrchXJNgSNIR_peQOaloA8TCcz9UHwUQTJ-TUpbtccTfXsCPTo5Gr0iF8hfXpOdqD3FwfdheL4Zaz2gFAluGCxx2qe7QrlMjum0vNR9Qec12iwD5VcfpEx_yRaCO_g9-UTWEWpRnftsHMIaxiMmfq1ChTTyVQdwbKYpcNkcmy0i0D0x_L9AjzbF_A
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Bibliometric+Survey+on+Incremental+Clustering+Algorithms&rft.jtitle=Library+philosophy+and+practice&rft.au=Chaudhari%2C+Archana&rft.au=Joshi%2C+Rahul+Raghvendra&rft.au=Mulay%2C+Preeti&rft.au=Kotecha%2C+Ketan&rft.date=2019-09-01&rft.pub=Library+Philosophy+and+Practice&rft.eissn=1522-0222&rft.spage=1&rft.epage=23&rft.externalDBID=HAS_PDF_LINK