2020
DOI: 10.1016/j.scitotenv.2020.140923
|View full text |Cite
|
Sign up to set email alerts
|

Efficient data preprocessing, episode classification, and source apportionment of particle number concentrations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
14
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(14 citation statements)
references
References 107 publications
0
14
0
Order By: Relevance
“…Evolutionary learning is a metaheuristic that offers compelling advantages when applied to machine learning as an AI optimizer: it learns adaptively, surveys the search space randomly, is representation independent (e.g., accepts categorical variables) and is intuitive and transparent. Metaheuristic methodologies have been an active area of research for decades and are often inspired by natural, stochastic phenomena like genetic selection, particle swarms (which have been applied to model hyperparameter tuning) or insect colony behavior (Liang et al, 2020 ). They have made major impacts in providing practical solutions to combinatorial problems in diverse scientific fields (Osman and Laporte, 1996 ).…”
Section: Discussionmentioning
confidence: 99%
“…Evolutionary learning is a metaheuristic that offers compelling advantages when applied to machine learning as an AI optimizer: it learns adaptively, surveys the search space randomly, is representation independent (e.g., accepts categorical variables) and is intuitive and transparent. Metaheuristic methodologies have been an active area of research for decades and are often inspired by natural, stochastic phenomena like genetic selection, particle swarms (which have been applied to model hyperparameter tuning) or insect colony behavior (Liang et al, 2020 ). They have made major impacts in providing practical solutions to combinatorial problems in diverse scientific fields (Osman and Laporte, 1996 ).…”
Section: Discussionmentioning
confidence: 99%
“…Although traditional receptor models such as PMF (Yue et al, 2008;Harrison et al, 2011;Dall'Osto et al, 2012;Tan et al, 2014;Liang et al, 2020;Liang et al, 2021) and k-means clustering (Charron et al, 2008;Beddows et al, 2009;Dall'Osto et al, 2012;Wegner et al, 2012;Salimi et al, 2014;Liang et al, 2020) have been applied for SA using particle number concentration, no attempts have been made previously to apply clustering algorithms on mass concentration data. In this study, we have implemented k-means clustering (kMC) as well as Spectral Clustering (SC) algorithms which are a part of Machine Learning (ML), on mass concentration data.…”
Section: A C C E P T E D Mmentioning
confidence: 99%
“…36 The algorithms of receptor models for PNC source apportionment include principal component analysis (PCA), 39 Kmeans clustering, 40 positive matrix factorization (PMF) 36 and non-negative matrix factorization (NMF). 41 K-Means clustering is a semi-quantitative method based on occurrence frequency, which produces mixed sources. 23,41 PMF is the most popular method for source apportionment of atmospheric pollutants.…”
Section: Introductionmentioning
confidence: 99%
“…41 K-Means clustering is a semi-quantitative method based on occurrence frequency, which produces mixed sources. 23,41 PMF is the most popular method for source apportionment of atmospheric pollutants. However, intensive computation of matrix inversion, singular value decomposition and error weighting during the solving process of PMF limit its calculation capacities for long-term and ne-size-resolution PNSD datasets.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation