Demo Data from EDBT 2026 / reviewers in the wild / expert
Amir Nikooienejad
dblp:65/7912
· DBLP profile ↗
3ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0003-4696-8300ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1Databases, data management, data science and information retrieval · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › feature selection
bayesian variable selection |
0.2 | 1 | 2016 | Bayesian variable selection for binary outcomes in high-dimensional genomic studies using non-local priors · Bioinform. 2016 |
Bioinformatics and computational biology › statistical genetics
genomic prediction |
0.2 | 1 | 2016 | Bayesian variable selection for binary outcomes in high-dimensional genomic studies using non-local priors · Bioinform. 2016 |
Bioinformatics and computational biology
genomics |
0.2 | 1 | 2016 | Bayesian variable selection for binary outcomes in high-dimensional genomic studies using non-local priors · Bioinform. 2016 |
Bioinformatics and computational biology › genomics › genomic data analysis
high-dimensional genomic data analysis |
0.2 | 1 | 2016 | Bayesian variable selection for binary outcomes in high-dimensional genomic studies using non-local priors · Bioinform. 2016 |
Methods — techniques the papers use, named apart from their topics
non-local priors · 0.2markov chain monte carlo · 0.2bayesian inference · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Automatic Eating Behavior Detection from Wrist Motion Sensor Using Bayesian, Gradient Boosting, and Topological Persistence MethodsabstractThe goal of this article is to develop a pattern recognition algorithm for detecting periods of food intake based on passively collected wearable device motion sensor data, accelerometer and gyroscope in a free-living condition. The main contributions of this work are the following. First, we use recently developed methods in topological data analysis (TDA) to create and extract key features. Second, we employ a novel Bayesian feature selection tool, BVSNLP, to reduce the dimensionality of the problem. Developing this algorithm in an efficient way, we believe it can be deployed on edge devices as well. We demonstrate the performance of our method on a dataset that contains a total of 1000 hours of accelerometer and gyroscope sensor data from 13 subjects. Amir Nikooienejad |
IEEE Big Data | 2 |
| 2016 | Bayesian variable selection for binary outcomes in high-dimensional genomic studies using non-local priorsabstractMOTIVATION: The advent of new genomic technologies has resulted in the production of massive data sets. Analyses of these data require new statistical and computational methods. In this article, we propose one such method that is useful in selecting explanatory variables for prediction of a binary response. Although this problem has recently been addressed using penalized likelihood methods, we adopt a Bayesian approach that utilizes a mixture of non-local prior densities and point masses on the binary regression coefficient vectors. RESULTS: The resulting method, which we call iMOMLogit, provides improved performance in identifying true models and reducing estimation and prediction error in a number of simulation studies. More importantly, its application to several genomic datasets produces predictions that have high accuracy using far fewer explanatory variables than competing methods. We also describe a novel approach for setting prior hyperparameters by examining the total variation distance between the prior distributions on the regression parameters and the distribution of the maximum likelihood estimator under the null distribution. Finally, we describe a computational algorithm that can be used to implement iMOMLogit in ultrahigh-dimensional settings ([Formula: see text]) and provide diagnostics to assess the probability that this algorithm has identified the highest posterior probability model. AVAILABILITY AND IMPLEMENTATION: Software to implement this method can be downloaded at: http://www.stat.tamu.edu/∼amir/code.html CONTACT: [email protected] or [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Amir Nikooienejad, Wenyi Wang 0001, Valen E. Johnson |
Bioinform. | 1 |
| 2009 | Robust Image Data Hiding Using Geometric Mean QuantizationabstractIn this paper, a novel quantization based watermarking method is proposed. For blind detection, a set of nonlinear convex functions based on geometric mean are investigated. In order to achieve minimum distortion, the optimum function set is found. The algorithm is implemented on the approximation coefficients of wavelet transform for natural images. In order to make the algorithm more robust and imperceptible, a new transform domain called Point to Point Graph (PPG), which converts a 1-D signal to a 2-D one, has been used. The error probability of the proposed scheme is analytically investigated. Simulation results show that this algorithm has great robustness against common attacks such as AWGN, JPEG and rotation in comparison with recent methods presented so far. Mohammad Ali Akhaee, Shahrokh Ghaemmaghami, Amir Nikooienejad, Farrokh Marvasti |
GLOBECOM | 3 |