http://repository.iiitd.edu.in/xmlui/handle/123456789/929 2026-04-10T22:01:10Z http://repository.iiitd.edu.in/xmlui/handle/123456789/1226 Population / patient phenotype similarity based GCN for survival analysis Kirtani, Chhavi; Prasad, Ranjitha (Advisor) Survival Analysis is an important field of research and has its application in medical fields. Researchers have been experimenting with multiple methods to provide a better predicting model for survival analysis, yet there are many improvements possible. We propose here a method combining two concepts together, i.e., Graph and Non-linear survival models in order to provide a better model for Survival Analysis. 2020-12-01T00:00:00Z http://repository.iiitd.edu.in/xmlui/handle/123456789/1225 A study on the BKZ lattice reduction algorithm Sharma, Pravek; Samajder, Subhabrata (Advisor) 2020-12-01T00:00:00Z http://repository.iiitd.edu.in/xmlui/handle/123456789/1224 Graph sub isomorphism Rajgaria, Abhishek; Rastogi, Preyansh; Goyal, Vikram (Advisor) Subgraph isomorphism problem is one of the most frequently encountered and extensively studied in the big graph database model and in Graph Theory. Graph Sub isomorphism problem is approached with machine learning techniques such as Graph Convolutional Network, representing the nodes in the form of embeddings such as node2vec and the Graph edit distance, for fi nding the dissimilarity of a Query node with respect to Target graph nodes. Using these a cost matrix is obtained and Munkres algorithm is applied to fi nd subgraph matching. Promising results are shown with these approaches, and deep learning techniques might be helpful to better approximate the cost matrix. 2020-06-01T00:00:00Z http://repository.iiitd.edu.in/xmlui/handle/123456789/999 Mass problems Dahal, Sameep; Basu, Sankha S. (Adviosr) There are several known problems that are algorithmically unsolvable such as the Halting problem, Hilbert’s 10th problem for Diophantine equations and so on. We are interested in the degree of insolvability of the problems that is to classify to the extent a problem is unsolvable. We discuss about the Mass Problems with respect to weak and strong reducibility as in [2] and explore the degree of insolvability of few mass problems. Furthermore, we discuss about randomness in the Cantor Space introduced in [1]. 2020-12-01T00:00:00Z