Search Results for author: Farhad Pourkamali-Anaraki

Found 17 papers, 3 papers with code

Probabilistic Neural Networks (PNNs) for Modeling Aleatoric Uncertainty in Scientific Machine Learning

no code implementations21 Feb 2024 Farhad Pourkamali-Anaraki, Jamal F. Husseini, Scott E. Stapleton

This paper investigates the use of probabilistic neural networks (PNNs) to model aleatoric uncertainty, which refers to the inherent variability in the input-output relationships of a system, often characterized by unequal variance or heteroscedasticity.

regression

Adaptive Activation Functions for Predictive Modeling with Sparse Experimental Data

1 code implementation8 Feb 2024 Farhad Pourkamali-Anaraki, Tahamina Nasrin, Robert E. Jensen, Amy M. Peterson, Christopher J. Hansen

A pivotal aspect in the design of neural networks lies in selecting activation functions, crucial for introducing nonlinear structures that capture intricate input-output patterns.

Image Classification

Two-Stage Surrogate Modeling for Data-Driven Design Optimization with Application to Composite Microstructure Generation

no code implementations4 Jan 2024 Farhad Pourkamali-Anaraki, Jamal F. Husseini, Evan J. Pineda, Brett A. Bednarcyk, Scott E. Stapleton

This paper introduces a novel two-stage machine learning-based surrogate modeling framework to address inverse problems in scientific and engineering fields.

D-CBRS: Accounting For Intra-Class Diversity in Continual Learning

no code implementations13 Jul 2022 Yasin Findik, Farhad Pourkamali-Anaraki

Continual learning -- accumulating knowledge from a sequence of learning experiences -- is an important yet challenging problem.

Continual Learning Management

An Empirical Evaluation of the t-SNE Algorithm for Data Visualization in Structural Engineering

no code implementations18 Sep 2021 Parisa Hajibabaee, Farhad Pourkamali-Anaraki, Mohammad Amin Hariri-Ardebili

A fundamental task in machine learning involves visualizing high-dimensional data sets that arise in high-impact application domains.

Data Visualization

Kernel Ridge Regression Using Importance Sampling with Application to Seismic Response Prediction

no code implementations19 Sep 2020 Farhad Pourkamali-Anaraki, Mohammad Amin Hariri-Ardebili, Lydia Morawiec

The first contribution is to propose a novel landmark selection method that promotes diversity using an efficient two-step approach.

Clustering regression

Scalable Spectral Clustering with Nystrom Approximation: Practical and Theoretical Aspects

no code implementations25 Jun 2020 Farhad Pourkamali-Anaraki

To address the limitations, this work presents a principled spectral clustering algorithm that exploits spectral properties of the similarity matrix associated with sampled points to regulate accuracy-efficiency trade-offs.

Clustering

Unsupervised Learning for Subterranean Junction Recognition Based on 2D Point Cloud

no code implementations7 Jun 2020 Sina Sharif Mansouri, Farhad Pourkamali-Anaraki, Miguel Castano Arranz, Ali-akbar Agha-mohammadi, Joel Burdick, George Nikolakopoulos

This article proposes a novel unsupervised learning framework for detecting the number of tunnel junctions in subterranean environments based on acquired 2D point clouds.

Clustering Navigate

The Effectiveness of Variational Autoencoders for Active Learning

no code implementations18 Nov 2019 Farhad Pourkamali-Anaraki, Michael B. Wakin

The high cost of acquiring labels is one of the main challenges in deploying supervised machine learning algorithms.

Active Learning

Large-Scale Sparse Subspace Clustering Using Landmarks

no code implementations2 Aug 2019 Farhad Pourkamali-Anaraki

Subspace clustering methods based on expressing each data point as a linear combination of all other points in a dataset are popular unsupervised learning techniques.

Clustering

Efficient Solvers for Sparse Subspace Clustering

1 code implementation17 Apr 2018 Farhad Pourkamali-Anaraki, James Folberth, Stephen Becker

The $\ell_0$ model is non-convex but only needs memory linear in $n$, and is solved via orthogonal matching pursuit and cannot handle the case of affine subspaces.

Clustering

Improved Fixed-Rank Nyström Approximation via QR Decomposition: Practical and Theoretical Aspects

no code implementations8 Aug 2017 Farhad Pourkamali-Anaraki, Stephen Becker

The Nystrom method is a popular technique that uses a small number of landmark points to compute a fixed-rank approximation of large kernel matrices that arise in machine learning problems.

Randomized Clustered Nystrom for Large-Scale Kernel Machines

no code implementations20 Dec 2016 Farhad Pourkamali-Anaraki, Stephen Becker

Moreover, we introduce a randomized algorithm for generating landmark points that is scalable to large-scale data sets.

Clustering

A Randomized Approach to Efficient Kernel Clustering

no code implementations26 Aug 2016 Farhad Pourkamali-Anaraki, Stephen Becker

Kernel-based K-means clustering has gained popularity due to its simplicity and the power of its implicit non-linear representation of the data.

Clustering

Estimation of the sample covariance matrix from compressive measurements

no code implementations30 Dec 2015 Farhad Pourkamali-Anaraki

Experimental results demonstrate that our approach allows for accurate estimation of the sample covariance matrix on several real-world data sets, including video data.

Preconditioned Data Sparsification for Big Data with Applications to PCA and K-means

2 code implementations31 Oct 2015 Farhad Pourkamali-Anaraki, Stephen Becker

We analyze a compression scheme for large data sets that randomly keeps a small percentage of the components of each data sample.

Efficient Dictionary Learning via Very Sparse Random Projections

no code implementations5 Apr 2015 Farhad Pourkamali-Anaraki, Stephen Becker, Shannon M. Hughes

Performing signal processing tasks on compressive measurements of data has received great attention in recent years.

Clustering Dictionary Learning

Cannot find the paper you are looking for? You can Submit a new open access paper.