scholarly journals Performance analysis of real-time face detection system based on stream data mining frameworks

2017 ◽  
Vol 201 ◽  
pp. 806-816 ◽  
Author(s):  
Nikolay Kazanskiy ◽  
Vladimir Protsenko ◽  
Pavel Serafimovich
Keyword(s):  
Data Mining ◽  
Performance Analysis ◽  
Real Time ◽  
Face Detection ◽  
Detection System ◽  
Stream Data ◽  
Stream Data Mining

Real-time stream data mining based on CanTree and Gtree

2016 ◽  
Vol 367-368 ◽  
pp. 512-528 ◽  
Author(s):  
Jaein Kim ◽  
Buhyun Hwang
Keyword(s):  
Data Mining ◽  
Real Time ◽  
Stream Data ◽  
Stream Data Mining

A Clustering Algorithm in Stream Data Using Strong Coreset

2021 ◽  
Author(s):  
Manmohan Singh ◽  
Rajendra Pamula ◽  
Alok Kumar
Keyword(s):  
Data Mining ◽  
Clustering Algorithm ◽  
Local Optimum ◽  
Reduction Algorithm ◽  
Stream Data ◽  
Stream Data Mining ◽  
Clustering Approach ◽  
Approximation Guarantee ◽  
Competitive Algorithms ◽  
Learning Data

There are various applications of clustering in the fields of machine learning, data mining, data compression along with pattern recognition. The existent techniques like the Llyods algorithm (sometimes called k-means) were affected by the issue of the algorithm which converges to a local optimum along with no approximation guarantee. For overcoming these shortcomings, an efficient k-means clustering approach is offered by this paper for stream data mining. Coreset is a popular and fundamental concept for k-means clustering in stream data. In each step, reduction determines a coreset of inputs, and represents the error, where P represents number of input points according to nested property of coreset. Hence, a bit reduction in error of final coreset gets n times more accurate. Therefore, this motivated the author to propose a new coreset-reduction algorithm. The proposed algorithm executed on the Covertype dataset, Spambase dataset, Census 1990 dataset, Bigcross dataset, and Tower dataset. Our algorithm outperforms with competitive algorithms like Streamkm[Formula: see text], BICO (BIRCH meets Coresets for k-means clustering), and BIRCH (Balance Iterative Reducing and Clustering using Hierarchies.

Sign in / Sign up

Export Citation Format

Share Document