Faculty Publications
Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736
Publications by NITK Faculty
Browse
6 results
Search Results
Item Alignment based similarity distance measure for better web sessions clustering(Elsevier B.V., 2011) Poornalatha, G.; Raghavendra, P.S.The evolution of the internet along with the popularity of the web has attracted a great attention among the researchers to web usage mining. Given that, there is an exponential growth in terms of amount of data available in the web that may not give the required information immediately; web usage mining extracts the useful information from the huge amount of data available in the web logs that contain information regarding web pages accessed. Due to this huge amount of data, it is better to handle small group of data at a time, instead of dealing with entire data together. In order to cluster the data, similarity measure is essential to obtain the distance between any two user sessions. The objective of this paper is to propose a technique, to measure the similarity between any two user sessions based on sequence alignment technique that uses the dynamic programming method. © 2011 Published by Elsevier Ltd.Item Query-oriented unsupervised multi-document summarization on big data(Association for Computing Machinery acmhelp@acm.org, 2016) Sunaina; Kamath S․, S.S.Real time document summarization is a critical need nowadays, owing to the large volume of information available for our reading, and our inability to deal with this entirely due to limitations of time and resources. Oftentimes, information is available in multiple sources, offering multiple contexts and viewpoints on a single topic of interest. Automated multi-document summarization (MDS) techniques aim to address this problem. However, current techniques for automated MDS suffer from low precision and accuracy with reference to a given subject matter, when compared to those summaries prepared by humans and takes large time to create the summary when the input given is too huge. In this paper, we propose a hybrid MDS technique combining feature based algorithms and dynamic programming for generating a summary from multiple documents based on user provided query. Further, in real-world scenarios, Web search serves up a large number of URLs to users, and the work of making sense of these with reference to a particular query is left to the user. In this context, an efficient parallelized MDS technique based on Hadoop is also presented, for serving a concise summary of multiple Webpage contents for a given user query in reduced time duration. © 2016 ACM.Item Process Logo: An Approach for Control-Flow Visualization of Information System Process in Process Mining(Springer Science and Business Media Deutschland GmbH, 2022) Manoj Kumar, M.V.; Bs, B.S.; Sneha, H.R.; Thomas, L.; Annappa, B.; Vishnu Srinivasa Murthy, Y.V.S.This paper proposes a new technique named “Process Logo†for visualizing the causal relationship between the activities of a process (Control flow). Traditional process mining algorithms rely on representing the activity as a sequence of operations modeled using nodes and edges, as the number of activities increases, the representation of the entire control flow becomes quite tedious. Process logo is a compact yet highly informative method for visually representing the process model. It visually summarizes the number of activities, sequence of execution, relative significance, and dependency between activities. It uses a dynamic programming method—sequence alignment and clustering approach with Levenshtein measure as a distance measure. The proposed method is evaluated on the synthetic event log, the experimental result is promising. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.Item Web sessions clustering using hybrid sequence alignment measure (HSAM)(Springer-Verlag Wien michaela.bolli@springer.at, 2013) Poornalatha, G.; Raghavendra, S.R.Web usage mining inspects the navigation patterns in web access logs and extracts previously unknown and useful information. This may lead to strategies for various web-oriented applications like web site restructure, recommender system, web page prediction and so on. The current work demonstrates clustering of user sessions of uneven lengths to discover the access patterns by proposing a distance method to group user sessions. The proposed hybrid distance measure uses the access path information to find the distance between any two sessions without altering the order in which web pages are visited. R2 is used to make a decision regarding the number of clusters to be constructed. Jaccard Index and Davies–Bouldin validity index are employed to assess the clustering done. The results obtained by these two standard statistic measures are encouraging and illustrate the goodness of the clusters created. © 2012, Springer-Verlag.Item Segmentation of intima media complex from carotid ultrasound images using wind driven optimization technique(Elsevier Ltd, 2018) Yamanakkanavar, Y.; Madipalli, P.; Rajan, J.; Kumar, P.K.; Narasimhadhan, A.V.Cardiovascular diseases are the third leading cause of death worldwide. The primitive indication of the possible onset of a cardiovascular disease is atherosclerosis, which is the accumulation of plaque on the arterial wall. The intima-media thickness (IMT) of the common carotid artery is an early marker of the development of cardiovascular disease. The computation of the IMT and the delineation of the carotid plaque are significant predictors for the clinical diagnosis of the risk of stroke. For a robust diagnosis, carotid ultrasound images must be free from speckle noise. To address this problem, we use state-of-the-art despeckling and enhancement methods in this work. Many edge-based methods for IMT estimation have been proposed to overcome the limitations of manual segmentation. In this paper, we present a fully automated region-of-interest (ROI) extraction and a threshold-based segmentation of the intima media complex (IMC) using a wind driven optimization (WDO) technique. A quantitative evaluation is carried out on 90 carotid ultrasound images of two different datasets. The obtained results are compared with those of state-of-the-art techniques such as a model-based approach, a dynamic programming method, and a snake segmentation method. The experimental analysis shows that the proposed method is robust in measuring the IMT in carotid ultrasound images. © 2017 Elsevier LtdItem Stochastic dynamic programming model for optimal resource allocation in vehicular ad hoc networks(Springer India, 2018) Bhuvaneswari, M.; Paramasivan, B.; Kandasamy, A.Vehicular ad hoc network (VANET) is an emerging trend where vehicles communicate with each other and possibly with a roadside unit to assist various applications like monitoring, managing and optimizing the transportation system. Collaboration among vehicles is significant in VANET. Resource constraint is one of the great challenges of VANETs. Because of the absence of centralized management, there is pitfall in optimal resource allocation, which leads to ineffective routing. Effective reliable routing is quite essential to achieve intelligent transportation. Stochastic dynamic programming is currently employed as a tool to analyse, develop and solve network resource constraint and allocation issues of resources in VANET. We have considered this work as a geographical-angular-zone-based two-phase dynamic resource allocation problem with a homogeneous resource class. This work uses a stochastic dynamic programming algorithm based on relaxed approximation to generate optimal resource allocation strategies over time in response to past task completion status history. The second phase resource allocation uses the observed outcome of the first phase task completion to provide optimal viability in resulting decisions. The proposed work will be further extended for the scenario that deals with heterogeneous resource class. Simulation results show that the proposed scheme works significantly well for the problems with identical resources. © 2018, Indian Academy of Sciences.