Anthony J. Pinar

Anthony J. Pinar

Auto-generated profile, based on publicly available information

Anthony J. Pinar

Electrical Engineering and Computer Science Departments, Michigan Technological University, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 May 2019 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
MIMuhammad Aminul Islam
Muhammad Aminul Islam
DADerek Anderson
Derek Anderson
APAnthony J. Pinar
Anthony J. Pinar
THTimothy C. Havens
Timothy C. Havens
GSGrant J. Scott
Grant J. Scott
JKJames Keller
James Keller
Information fusion is an essential part of numerous engineering systems and biological functions, e.g., human cognition. Fusion occurs at many levels, ranging from the low-level combination of signals to the high-level aggregation of heterogeneous decision-making processes. While the last decade has witnessed an explosion of research in deep learning, fusion in neural networks has not observed the same revolution. Specifically, most neural fusion approaches are ad hoc, are not understood, are distributed versus localized, and/or explainability is low (if present at all). Herein, we prove that the fuzzy Choquet integral (ChI), a powerful nonlinear aggregation function, can be represented as a multi-layer network, referred to hereafter as ChIMP. We also put forth an improved ChIMP (iChIMP) that leads to a stochastic gradient descent-based optimization in light of the exponential number of ChI inequality constraints. An additional benefit of ChIMP/iChIMP is that it enables eXplainable AI (XAI). Synthetic validation experiments are provided and iChIMP is applied to the fusion of a set of heterogeneous architecture deep models in remote sensing. We show an improvement in model accuracy and our previously established XAI indices shed light on the quality of our data, model, and its decisions.

12 October 2016 in IEEE Robotics and Automation Letters
Verified
Journal Article
Open access
BPBrian Page
Brian Page
SZSaeedeh Ziaeefard
Saeedeh Ziaeefard
APAnthony J. Pinar
Anthony J. Pinar
NMNina Mahmoudian
Nina Mahmoudian
This letter presents the design and potential impact of the developed Research Oriented Underwater Glider for Hands-on Investigative Engineering (ROUGHIE). The ROUGHIE is an open-source, highly maneuverable, and low-cost vehicle that enables rapid development and testing of new hardware and software. ROUGHIE is an internally actuated glider capable of performing steady sawtooth glides in shallow water down to 3 m, tight turns with a minimum radius of 3 m, and a minimum endurance of 60 h. The novelty of this study is twofold: 1) a rail-based design to facilitate modularity and ease of assembly and 2) an effective internal rotary mass mechanism to increase maneuverability and perform tight turns. The ROUGHIE design strategically uses 3D printed plastic parts in low stress situations, which allows extreme design flexibility and enables tightly packed modules that can be easily customized.

29 November 2016 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
APAnthony J. Pinar
Anthony J. Pinar
JRJoseph Rice
Joseph Rice
LHLequn Hu
Lequn Hu
DADerek Anderson
Derek Anderson
THTimothy C. Havens
Timothy C. Havens
Kernel methods for classification is a well-studied area in which data are implicitly mapped from a lower-dimensional space to a higher dimensional space to improve classification accuracy. However, for most kernel methods, one must still choose a kernel to use for the problem. Since there is, in general, no way of knowing which kernel is the best, multiple kernel learning (MKL) is a technique used to learn the aggregation of a set of valid kernels into a single (ideally) superior kernel. The aggregation can be done using weighted sums of the precomputed kernels, but determining the summation weights is not a trivial task. Furthermore, MKL does not work well with large datasets because of limited storage space and prediction speed. In this paper, we address all three of these multiple kernel challenges. First, we introduce a new linear feature level fusion technique and learning algorithm, GAMKLp. Second, we put forth three new algorithms, DeFIMKL, DeGAMKL, and DeLSMKL, for nonlinear fusion of kernels at the decision level. To address MKL's storage and speed drawbacks, we apply the Nystrom approximation to the kernel matrices. We compare our methods to a successful and state-of-the-art technique called MKL-group lasso (MKLGL), and experiments on several benchmark datasets show that some of our proposed algorithms outperform MKLGL when applied to support vector machine (SVM)-based classification. However, to no surprise, there does not seem to be a global winner but instead different strategies that a user can employ. Experiments with our kernel approximation method show that we can routinely discard most of the training data and at least double prediction speed without sacrificing classification accuracy. These results suggest that MKL-based classification techniques can be applied to big data efficiently, which is confirmed by an experiment using a large dataset.

20 September 2017 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
MIMuhammad Aminul Islam
Muhammad Aminul Islam
DADerek Anderson
Derek Anderson
APAnthony J. Pinar
Anthony J. Pinar
THTimothy C. Havens
Timothy C. Havens
The $Choquet integral$ (ChI) is a parametric nonlinear aggregation function defined with respect to the $fuzzy measure$ (FM). To date, application of the ChI has sadly been restricted to problems with relatively few numbers of inputs; primarily as the FM has 2$^{N}$ variables for $N$ inputs and $N$(2$^{N-1}$-1) monotonicity constraints. In return, the community has turned to density-based imputation (e.g, Sugeno λ-FM) or the number of $interactions$ (FM variables) are restricted (e.g., $k$-additivity). Herein, we propose a new scalable data-driven way to represent and learn the ChI, making learning computationally manageable for larger $N$. First, data supported variables are identified and used in optimization. Identification of these variables also allows us recognize future ill posed fusion scenarios; ChIs involving variable subsets not supported by data. Second, we outline an imputation function framework to address data unsupported variables. Third, we present a lossless way to compress redundant variables and associated monotonicity constraints. Last, we outline a lossy approximation method to further compress the ChI (if/when desired). Computational complexity analysis and experiments conducted on synthetic data sets with known FMs demonstrate the effectiveness and efficiency of the proposed theory.

27 July 2020 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
BMBryce J. Murray
Bryce J. Murray
MIMuhammad Aminul Islam
Muhammad Aminul Islam
APAnthony J. Pinar
Anthony J. Pinar
DADerek Anderson
Derek Anderson
GSGrant J. Scott
Grant J. Scott
JKJames Keller
James Keller
The modern era of machine learning is focused on data-driven solutions. While this has resulted in astonishing leaps in numerous applications, explainability has not witnessed the same growth. The reality is, most machine learning solutions are black boxes. Herein, we focus on data/information fusion in machine learning. Specifically, we explore four eXplainable Artificial Intelligence (XAI) questions relative to Choquet integral; (i) what is the quality of our inputs and their interactions, (ii) how is the information being combined, (iii) what is the quality of our training data (and thus our learned models), and (iv) what trust do we place in an output? Previously, we derived an initial set of indices for (i)–(iv) on the premise of perfect knowledge. Herein, we make XAI more accurate by taking into consideration what the machine learned. A combination of synthetic data and real-world experiments from remote sensing for fusing deep learners in the context of classification are explored. Our approach leads to performance gain, insights into what was learned, and it helps us realize better future solutions.

12 June 2017 in Granular Computing
Verified
Journal Article
Closed access
PDF file
APAnthony J. Pinar
Anthony J. Pinar
DADerek Anderson
Derek Anderson
THTimothy C. Havens
Timothy C. Havens
AZAlina Zare
Alina Zare
TATitilope Adeyeba
Titilope Adeyeba