Volkan ALTUNTAŞ

Dr. Volkan ALTUNTAŞ

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
19 November 2018 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
VAVolkan ALTUNTAŞ
Volkan ALTUNTAŞ
MGMurat Gök
Murat Gök
TKTamer Kahveci
Tamer Kahveci
Computational knowledge acquired from noisy networks is not reliable and the network topology determines the reliability. Protein-protein interaction networks have uncertain topologies and noise that contain false positive and false negative edges at high rates. In this study, we analyze effects of the existing mutations in a network topology to the diffusion state of that network. To evaluate the sensitivity of the diffusion state, we derive the fitness measures based on the mathematically defined stability of a network. Searching for an influential set of edges in a network is a difficult problem. We handle the computational challenge by developing a novel metaheuristic optimization method and we find influential mutations time-efficiently. Our experiments, conducted on both synthetic and real networks from public databases, demonstrated that our method obtained better results than competitors for all types of network topologies. This is the first-time that the diffusion has been evaluated under topological mutations. Our analysis identifies significant biological results about the stability of biological - synthetic networks and diffusion state. In this manner, mutations in protein-protein interaction network topologies have a significant influence on the diffusion state of the network. Network stability is more affected by the network model than the network size.

29 July 2024 in Ocean & Coastal Management
Verified
Journal Article
Closed access
EDErinc Dobrucali
Erinc Dobrucali
SUSinan Uyanik
Sinan Uyanik
VAVolkan ALTUNTAŞ
Volkan ALTUNTAŞ
MYMete Yilmaz
Mete Yilmaz
MBMuharrem Balci
Muharrem Balci
DUDeniz Uçar
Deniz Uçar

30 June 2023 in Kırklareli Üniversitesi Mühendislik ve Fen Bilimleri Dergisi
Verified
Journal Article
Open access
PDF file
ZBZeynep Barut
Zeynep Barut
VAVolkan ALTUNTAŞ
Volkan ALTUNTAŞ
In machine learning, the k value in the k-fold cross-validation method significantly affects the performance of the created model. In the studies that have been done, the k value is usually taken as five or ten because these two values are thought to produce average estimates. However, there is no official rule. It has been observed that few studies have been carried out to use different k values in the training of different models. In this study, a performance evaluation was performed on the IncRNA-disease model using various k values (2, 3, 4, 5, 6, 7, 8, 9, and 10) and datasets. The obtained results were compared and the most suitable k value for the model was determined. In future studies, it is aimed to carry out a more comprehensive study by increasing the number of data sets.

16 January 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
VAVolkan ALTUNTAŞ
Volkan ALTUNTAŞ
Network node embedding captures structural and relational information of nodes in the network and allows for us to use machine learning algorithms for various prediction tasks on network data that have an inherently complex and disordered structure. Network node embedding should preserve as much information as possible about important network properties where information is stored, such as network structure and node properties, while representing nodes as numerical vectors in a lower-dimensional space than the original higher dimensional space. Superior node embedding algorithms are a powerful tool for machine learning with effective and efficient node representation. Recent research in representation learning has led to significant advances in automating features through unsupervised learning, inspired by advances in natural language processing. Here, we seek to improve the representation quality of node embeddings with a new node vectorization technique that uses network analysis to overcome network-based information loss. In this study, we introduce the NodeVector algorithm, which combines network analysis and neural networks to transfer information from the target network to node embedding. As a proof of concept, our experiments performed on different categories of network datasets showed that our method achieves better results than its competitors for target networks. This is the first study to produce node representation by unsupervised learning using the combination of network analysis and neural networks to consider network data structure. Based on experimental results, the use of network analysis, complex initial node representation, balanced negative sampling, and neural networks has a positive effect on the representation quality of network node embedding.

17 October 2022 in Journal of Innovative Science and Engineering
Verified
Journal Article
Open access
ŞDŞeyma Doğru
Şeyma Doğru
VAVolkan ALTUNTAŞ
Volkan ALTUNTAŞ
Today, with the development of technology, the decision-making capabilities of machines have also increased. With their high analytical skills, computers can easily catch points and relationships that may escape the human eye. Thanks to these capabilities, machines are also widely used in the field of health. For example, many machine learning techniques developed on cancer prediction have been successfully applied. Early detection of cancer is crucial to survival. In the early diagnosis of cancer, the rates of drug treatment, chemotherapy or radiotherapy that the person will be exposed to are significantly reduced and the patient gets through this process with the least amount of wear and tear. Gene Expression Cancer RNA-Seq Dataset was used in this study. This data set includes gene expression values of 5 cancer types (BRCA, KIRC, LUAD, LUSC, UCEC). DNA sequences in the dataset were analyzed using k-means and hierarchical clustering algorithms, which are unsupervised machine learning methods. The aim of the study is to develop a usable machine learning model for early detection of cancer at the gene level. Adjusted Rand Index (ARI), Silhouette Score, and Accuracy metrics were used to evaluate the analysis results. The rand index calculates similarity between clusters by counting the binaries assigned to clusters. The adjusted Rand Index is a randomly adjusted version of the Rand Index. The silhouette score indicates how well a data point fits within its own set among separated datasets. The accuracy metric is obtained as a percentage of correctly clustered data points divided by all predictions. Different connection methods are used in the hierarchical clustering algorithm. These are 'complete', 'ward', 'average' and 'single'. As a result of the study, the accuracy in the k-means algorithm was 0.990, the Adjusted Rand Index was 0.79, and the Silhouette Score was 0.14. Looking at the hierarchical clustering, ward performed the best of the four linkage methods, with an ARI score of 0.76 and a silhouette score of 0.13. As a result of the study, the accuracy of in the hierarchical clustering algorithm was 0.999.

23 June 2022 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
VAVolkan ALTUNTAŞ
Volkan ALTUNTAŞ
Interaction networks can be used to predict the functions of unknown proteins using known interactions and proteins with known functions. Many graph theory or diffusion-based methods have been proposed, using the assumption that the topological properties of a protein in a network are related to its biological function. Here we seek to improve function prediction by finding more similar neighbors with a new diffusion-based alignment technique to overcome the topological information loss of the node. In this study, we introduce the Diffusion Alignment Coefficient (DAC) algorithm, which combines diffusion, longest common subsequence, and longest common substring techniques to measure the similarity of two nodes in protein interaction networks. As a proof of concept, our experiments, conducted on a real PPI networks S.cerevisiae and Homo Sapiens, demonstrated that our method obtained better results than competitors for MIPS and MSigDB Collections hallmark gene set functional categories. This is the first study to develop a measure of node function similarity using alignment to consider the positions of nodes in protein-protein interaction networks. According to the experimental results, the use of spatial information belonging to the nodes in the network has a positive effect on the detection of more functionally similar neighboring nodes.