InTDS ArchivebyRıza Özçelik·May 17, 2022A Very Friendly Starting Guide for Terminal and GitTerminal and Git are fundamental tools to develop software projects and here is a simple, practical, and very friendly starting guideA response icon1A response icon1
Rıza Özçelik·Aug 7, 2021Boğaziçi Üniversitesi Bilgisayar Mühendisliği’ni Niye Çok Seviyorum?Hoşgeldin! Sana biraz Boğaziçi Üniversitesi Bilgisayar Mühendisliği’nin (kısaca BOUN-CMPE) güzelliklerinden bahsetmek istiyorum. Ama önce…
InTDS ArchivebyRıza Özçelik·May 16, 2020Regression Trees from Scratch in 30 lines of PythonWe describe and implement regression trees to predict house prices in Boston.A response icon1A response icon1
InTDS ArchivebyRıza Özçelik·Dec 29, 2019Using GraphSAGE to Learn Paper Embeddings in CORAHere we use stellargraph library to learn paper embeddings on CORA via GraphSAGE algorithm.
InTDS ArchivebyRıza Özçelik·Dec 11, 2019EDA on Graphs via networkxExploring OntoBiotope Habitat Taxonomy with networkx library
InTDS ArchivebyRıza Özçelik·Nov 25, 2019Solving Minimum Path Cover on a DAGWe discuss an algorithm to find a minimum path cover on a DAG.
InTDS ArchivebyRıza Özçelik·Nov 23, 2019A*: Adding Heuristics to DijkstraA* speeds up the well-known Dijkstra algorithm by leveraging heuristics.
InTDS ArchivebyRıza Özçelik·Nov 13, 2019An Intuitive Explanation of EmbedSMost GDL techniques ignore the semantics of the network. EmbedS aims to represent semantic relations as well.
InTDS ArchivebyRıza Özçelik·Oct 28, 2019An Intuitive Explanation of NeoDTINeoDTI is a task-specific node embedding learning algorithm for link prediction on heterogeneous networks.
InTDS ArchivebyRıza Özçelik·Oct 22, 2019An Intuitive Explanation of GraphSAGEInductive learning is useful in dynamic datasets. Here we discuss an inductive learning algorithm on graphs.A response icon3A response icon3