Top 10 algorithms in data mining

X Wu, V Kumar, J Ross Quinlan, J Ghosh… - … and information systems, 2008 - Springer
This paper presents the top 10 data mining algorithms identified by the IEEE International
Conference on Data Mining (ICDM) in December 2006: C4. 5, k-Means, SVM, Apriori, EM …

Systematic review of privacy-preserving distributed machine learning from federated databases in health care

F Zerka, S Barakat, S Walsh, M Bogowicz… - JCO clinical cancer …, 2020 - ascopubs.org
Big data for health care is one of the potential solutions to deal with the numerous
challenges of health care, such as rising cost, aging population, precision medicine …

[HTML][HTML] Internet of things and data mining: An application oriented survey

P Sunhare, RR Chowdhary… - Journal of King Saud …, 2022 - Elsevier
Advancement in the fields of electronic communication, data processing, and internet
technologies enable easy access to and interaction with a variety of physical devices …

A traffic motion object extraction algorithm

S Wu - International Journal of Bifurcation and Chaos, 2015 - World Scientific
A motion object extraction algorithm based on the active contour model is proposed. Firstly,
moving areas involving shadows are segmented with the classical background difference …

[КНИГА][B] Partitional clustering algorithms

ME Celebi - 2015 - Springer
Clustering, the unsupervised classification of patterns into groups, is one of the most
important tasks in exploratory data analysis. Primary goals of clustering include gaining …

Scalable learning of collective behavior based on sparse social dimensions

L Tang, H Liu - Proceedings of the 18th ACM conference on …, 2009 - dl.acm.org
The study of collective behavior is to understand how individuals behave in a social network
environment. Oceans of data generated by social media like Facebook, Twitter, Flickr and …

A linear time-complexity k-means algorithm using cluster shifting

MK Pakhira - 2014 international conference on computational …, 2014 - ieeexplore.ieee.org
The k-means algorithm is known to have a time complexity of O (n 2), where n is the input
data size. This quadratic complexity debars the algorithm from being effectively used in large …

Data compression for the exascale computing era-survey

SW Son, Z Chen, W Hendrix, A Agrawal… - Supercomputing …, 2014 - superfri.susu.ru
While periodic checkpointing has been an important mechanism for tolerating faults in high-
performance computing (HPC) systems, it is cost-prohibitive as the HPC system approaches …

Machine learning enabled reduced-order scenario generation for stochastic analysis of solar power forecasts

S Bhavsar, R Pitchumani, MA Ortega-Vazquez - Applied energy, 2021 - Elsevier
With increased reliance on solar-based energy generation in modern power systems, the
problem of managing uncertainty in power system operation becomes crucial. However, in …

Single-pass and linear-time k-means clustering based on MapReduce

S Shahrivari, S Jalili - Information Systems, 2016 - Elsevier
In recent years, k-means has been fitted into the MapReduce framework and hence it has
become a very effective solution for clustering very large datasets. However, k-means is not …