Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
The model selection methods for sparse biological networks
Date
2019-10-30
Author
Purutçuoğlu Gazi, Vilda
Metadata
Show full item record
Item Usage Stats
303
views
0
downloads
Cite This
It is still crucial problem to estimate high dimensional graphical models and to choose the regularization parameter in dependent data. There are several classical methods such as Akaike’s information criterion and Bayesian Information criterion to solve this problem, but also more recent methods have been proposed such as stability selection and stability approach to regularization selection method (StARS) and some extensions of AIC and BIC which are more appropriate for high dimensional datasets. In this review, we give some overview about these methods and also give their consistency properties for graphical lasso. Then, we evaluate the performance of these approaches in real datasets. Finally, we propose the theoretical background of our proposal model selection criterion that is based on the KL-divergence and the bootstrapping computation, and is particularly suggested for the sparse biological networks.
URI
https://hdl.handle.net/11511/88190
Conference Name
International Conference on Artificial Intelligence and Applied Mathematics in Engineering, (20 - 22 Nisan 2019)
Collections
Department of Chemistry, Conference / Seminar
Suggestions
OpenMETU
Core
An Algorithm for the forward step of adaptive regression slines via mapping approach
Kartal Koç, Elçin; Batmaz, İnci; İyigün, Cem; Department of Statistics (2012)
In high dimensional data modeling, Multivariate Adaptive Regression Splines (MARS) is a well-known nonparametric regression technique to approximate the nonlinear relationship between a response variable and the predictors with the help of splines. MARS uses piecewise linear basis functions which are separated from each other with breaking points (knots) for function estimation. The model estimating function is generated in two stepwise procedures: forward selection and backward elimination. In the first st...
A genetic algorithm for 2d shape optimization
Chen, Wei Hang; Oral, Süha; Department of Mechanical Engineering (2008)
In this study, an optimization code has been developed based on genetic algorithms associated with the finite element modeling for the shape optimization of plane stress problems. In genetic algorithms, constraints are mostly handled by using the concept of penalty functions, which penalize infeasible solutions by reducing their fitness values in proportion to the degrees of constraint violation. In this study, An Improved GA Penalty Scheme is used. The proposed method gives information about unfeasible ind...
Representation of Multiplicative Seasonal Vector Autoregressive Moving Average Models
Yozgatlıgil, Ceylan (Informa UK Limited, 2009-11-01)
Time series often contain observations of several variables and multivariate time series models are used to represent the relationship between these variables. There are many studies on vector autoregressive moving average (VARMA) models, but the representation of multiplicative seasonal VARMA models has not been seriously studied. In a multiplicative vector model, such as a seasonal VARMA model, the representation is not unique because of the noncommutative property of matrix multiplication. In this articl...
Optimization of the array geometry for direction finding
Özaydın, Seval; Koç, Seyit Sencer; Tanık, Yalçın; Department of Electrical and Electronics Engineering (2003)
In this thesis, optimization of the geometry of non-uniform arrays for direction finding yielding unambiguous results is studied. A measure of similarity between the array response vectors is defined. In this measure, the effects of antenna array geometry, source placements and antenna gains are included as variable parameters. Then, assuming that the antenna gains are known and constant, constraints on the similarity function are developed and described to result in unambiguous configurations and maximum r...
Automated inverse analysis of a deep excavation in Ankara clay using finite element analysis
Engin, Tugce Aktas; Çokça, Erdal (2021-10-01)
The objective of this study is to find out the constant that shows a linear relationship between the deformation modulus parameter of Ankara clay and SPT N-60 values by using Plaxis 2D software. During analyses, three constitutive models are used, those are Mohr-Coulomb (MC), hardening soil model (HS), and hardening soil model with small strain stiffness (HSsmall). For that purpose, reverse analysis of a 25.0-m deep excavation was done by comparing results with displacements taken from inclinometer measurem...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
V. Purutçuoğlu Gazi, “The model selection methods for sparse biological networks,” 2019, vol. 107, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/88190.