SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Devagiri Vishnu Manasa) "

Search: WFRF:(Devagiri Vishnu Manasa)

  • Result 1-10 of 14
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Angelova, Milena, et al. (author)
  • An Expertise Recommender System based on Data from an Institutional Repository (DiVA)
  • 2019
  • In: Connecting the Knowledge Common from Projects to sustainable Infrastructure. - : OpenEdition Press. - 9791036538018 - 9791036538025 ; , s. 135-149
  • Book chapter (peer-reviewed)abstract
    • Finding experts in academics is an important practical problem, e.g. recruiting reviewersfor reviewing conference, journal or project submissions, partner matching for researchproposals, finding relevant M. Sc. or Ph. D. supervisors etc. In this work, we discuss anexpertise recommender system that is built on data extracted from the Blekinge Instituteof Technology (BTH) instance of the institutional repository system DiVA (DigitalScientific Archive). DiVA is a publication and archiving platform for research publicationsand student essays used by 46 publicly funded universities and authorities in Sweden andthe rest of the Nordic countries (www.diva-portal.org). The DiVA classification system isbased on the Swedish Higher Education Authority (UKÄ) and the Statistic Sweden's (SCB)three levels classification system. Using the classification terms associated with studentM. Sc. and B. Sc. theses published in the DiVA platform, we have developed a prototypesystem which can be used to identify and recommend subject thesis supervisors in academy.
  •  
2.
  • Angelova, Milena, et al. (author)
  • An Expertise Recommender SystemBased on Data from an Institutional Repository (DiVA)
  • 2018
  • In: Proceedings of the 22nd edition of the International Conference on ELectronic PUBlishing. - : OpenEdition Press.
  • Conference paper (peer-reviewed)abstract
    • Finding experts in academics is an important practical problem, e.g. recruiting reviewersfor reviewing conference, journal or project submissions, partner matching for researchproposals, finding relevant M. Sc. or Ph. D. supervisors etc. In this work, we discuss anexpertise recommender system that is built on data extracted from the Blekinge Instituteof Technology (BTH) instance of the institutional repository system DiVA (DigitalScientific Archive). DiVA is a publication and archiving platform for research publicationsand student essays used by 46 publicly funded universities and authorities in Sweden andthe rest of the Nordic countries (www.diva-portal.org). The DiVA classification system isbased on the Swedish Higher Education Authority (UKÄ) and the Statistic Sweden's (SCB)three levels classification system. Using the classification terms associated with studentM. Sc. and B. Sc. theses published in the DiVA platform, we have developed a prototypesystem which can be used to identify and recommend subject thesis supervisors inacademy.
  •  
3.
  • Bejdevi, Åsa, 1978-, et al. (author)
  • Virtual Reality in Online Instruction : a pilot study on learning experiences
  • 2024
  • In: Journal of Teaching and Learning in Higher Education. - : Malmö Universitet. - 2004-4097. ; 5:2
  • Journal article (other academic/artistic)abstract
    • Online instruction has become increasingly common as an alternative to face-to-face instruction (Crawford-Ferre & Wiest, 2012; Maertens et al., 2016; Ananga & Biney, 2017). One benefit with online instruction is that it is more easily accessible for students who are not able to fully access the more traditional face-to-face instruction on campus. After the Covid-19 pandemic, online instruction has gained further ground (Zhu & Liu, 2020; Kerres & Buchner, 2022; Li et al., 2022). At the same time, we have seen a rapid increase in new educational technologies, including that of virtual reality (Ding & Li, 2022; Al-Ansi et al., 2023; Zhang et al., 2022). Studies show that virtual reality (VR) can make the learning process more engaging and interactive (Jackson & Fagan, 2000; Ardiny& Khanmirza, 2018; Roopa et al., 2021) and that it can increase reception levels and train collaborative skills (Isik-Ercan et al., 2010; Petersen et al., 2023). This paper raises the question of how the use of virtual reality in online instruction affects learning experiences. While the participants in the pilot study displayed a genuine enthusiasm for using VR in an online setting, results showed a lack of knowledge in how to use VR to improve student learning. One area of investigation was concentration. Here, results were inconclusive as 50 % of the participants in group 1 (G1) were unsure of whether VR improves concentration, while 50 % of the participants in group 2 (G2) claimed that the use of VR does improve their concentration level. Another area of investigation was understanding the topic. The participants from G1 gave higher ratings than those who performed the experiment in G2, which implies that the impact was not as great as expected. In fact, the participants in G2 found that the VR equipment shifted focus from learning to other details in the visual medium. Another area was interactivity. Here, results indicated that VR technology has the didactic potential of engaging students and making them more interactive in the learning situation. The study concludes that while VR technology has the possibility of enhancing learning, a prerequisite is that both students and teachers have the skills and knowledge of how to use VR technology in a pedagogical setting; furthermore, a few technical modifications to the device itself are required.
  •  
4.
  • Boeva, Veselka, Professor, et al. (author)
  • Bipartite Split-Merge Evolutionary Clustering
  • 2019
  • In: Lect. Notes Comput. Sci.. - Cham : Springer. - 9783030374938 ; , s. 204-223
  • Conference paper (peer-reviewed)abstract
    • We propose a split-merge framework for evolutionary clustering. The proposed clustering technique, entitled Split-Merge Evolutionary Clustering is supposed to be more robust to concept drift scenarios by providing the flexibility to consider at each step a portion of the data and derive clusters from it to be used subsequently to update the existing clustering solution. The proposed framework is built around the idea to model two clustering solutions as a bipartite graph, which guides the update of the existing clustering solution by merging some clusters with ones from the newly constructed clustering while others are transformed by splitting their elements among several new clusters. We have evaluated and compared the discussed evolutionary clustering technique with two other state of the art algorithms: a bipartite correlation clustering (PivotBiCluster) and an incremental evolving clustering (Dynamic split-and-merge). © Springer Nature Switzerland AG 2019.
  •  
5.
  •  
6.
  • Devagiri, Vishnu Manasa, et al. (author)
  • A Multi-view Clustering Approach for Analysis of Streaming Data
  • 2021
  • In: IFIP Advances in Information and Communication Technology. - Cham : Springer Science and Business Media Deutschland GmbH. - 9783030791490 ; , s. 169-183
  • Conference paper (peer-reviewed)abstract
    • Data available today in smart monitoring applications such as smart buildings, machine health monitoring, smart healthcare, etc., is not centralized and usually supplied by a number of different devices (sensors, mobile devices and edge nodes). Due to which the data has a heterogeneous nature and provides different perspectives (views) about the studied phenomenon. This makes the monitoring task very challenging, requiring machine learning and data mining models that are not only able to continuously integrate and analyze multi-view streaming data, but also are capable of adapting to concept drift scenarios of newly arriving data. This study presents a multi-view clustering approach that can be applied for monitoring and analysis of streaming data scenarios. The approach allows for parallel monitoring of the individual view clustering models and mining view correlations in the integrated (global) clustering models. The global model built at each data chunk is a formal concept lattice generated by a formal context consisting of closed patterns representing the most typical correlations among the views. The proposed approach is evaluated on two different data sets. The obtained results demonstrate that it is suitable for modelling and monitoring multi-view streaming phenomena by providing means for continuous analysis and pattern mining. © 2021, IFIP International Federation for Information Processing.
  •  
7.
  • Devagiri, Vishnu Manasa (author)
  • Clustering Techniques for Mining and Analysis of Evolving Data
  • 2021
  • Licentiate thesis (other academic/artistic)abstract
    • The amount of data generated is on rise due to increased demand for fields like IoT, smart monitoring applications, etc. Data generated through such systems have many distinct characteristics like continuous data generation, evolutionary, multi-source nature, and heterogeneity. In addition, the real-world data generated in these fields is largely unlabelled. Clustering is an unsupervised learning technique used to group, analyze and interpret unlabelled data. Conventional clustering algorithms are not suitable for dealing with data having previously mentioned characteristics due to memory and computational constraints, their inability to handle concept drift, distributed location of data. Therefore novel clustering approaches capable of analyzing and interpreting evolving and/or multi-source streaming data are needed. The thesis is focused on building evolutionary clustering algorithms for data that evolves over time. We have initially proposed an evolutionary clustering approach, entitled Split-Merge Clustering (Paper I), capable of continuously updating the generated clustering solution in the presence of new data. Through the progression of the work, new challenges have been studied and addressed. Namely, the Split-Merge Clustering algorithm has been enhanced in Paper II with new capabilities to deal with the challenges of multi-view data applications. A multi-view or multi-source data presents the studied phenomenon/system from different perspectives (views), and can reveal interesting knowledge that is not visible when only one view is considered and analyzed. This has motivated us to continue in this direction by designing two other novel multi-view data stream clustering algorithms. The algorithm proposed in Paper III improves the performance and interpretability of the algorithm proposed in Paper II. Paper IV introduces a minimum spanning tree based multi-view clustering algorithm capable of transferring knowledge between consecutive data chunks, and it is also enriched with a post-clustering pattern-labeling procedure. The proposed and studied evolutionary clustering algorithms are evaluated on various data sets. The obtained results have demonstrated the robustness of the algorithms for modeling, analyzing, and mining evolving data streams. They are able to adequately adapt single and multi-view clustering models by continuously integrating newly arriving data. 
  •  
8.
  • Devagiri, Vishnu Manasa, et al. (author)
  • Domain Adaptation Through Cluster Integration and Correlation
  • 2022
  • In: IEEE International Conference on Data Mining Workshops, ICDMW. - : IEEE Computer Society. - 9798350346091 ; , s. 119-126
  • Conference paper (peer-reviewed)abstract
    • Domain shift is a common problem in many real-world applications using machine learning models. Most of the existing solutions are based on supervised and deep-learning models. This paper proposes a novel clustering algorithm capable of producing an adapted and/or integrated clustering model for the considered domains. Source and target domains are represented by clustering models such that each cluster of a domain models a specific scenario of the studied phenomenon by defining a range of allowable values for each attribute in a given data vector. The proposed domain integration algorithm works in two steps: (i) cross-labeling and (ii) integration. Initially, each clustering model is crossly applied to label the cluster representatives of the other model. These labels are used to determine the correlations between the two models to identify the common clusters for both domains, which must be integrated within the second step. Different features of the proposed algorithm are studied and evaluated on a publicly available human activity recognition (HAR) data set and real-world data from a smart logistics use case provided by an industrial partner. The experiment's goal on the HAR data set is to showcase the algorithm's potential in automatic data labeling. While the conducted experiments on the smart logistics use case evaluate and compare the performance of the integrated and two adapted models in different domains. © 2022 IEEE.
  •  
9.
  • Devagiri, Vishnu Manasa (author)
  • Mining Evolving and Heterogeneous Data : Cluster-based Analysis Techniques
  • 2024
  • Doctoral thesis (other academic/artistic)abstract
    • A large amount of data is generated from fields like IoT, smart monitoring applications, etc., raising demand for suitable data analysis and mining techniques. Data produced through such systems have many distinct characteristics, like continuous generation, evolving nature, multi-source origin, and heterogeneity, and in addition are usually not annotated. Clustering is an unsupervised learning technique used to group and analyze unlabeled data. Conventional clustering algorithms are unsuitable for dealing with data with the mentioned characteristics due to memory, computational constraints, and their inability to handle the heterogeneous and evolving nature of the data. Therefore, novel clustering approaches are needed to analyze and interpret such challenging data. This thesis focuses on building and studying advanced clustering algorithms that can address the main challenges of today's real-world data: evolving and heterogeneous nature. An evolving clustering approach capable of continuously updating the generated clustering solution in the presence of new data is initially proposed, which is later extended to address the challenges of multi-view data applications. Multi-view or multi-source data presents the studied phenomenon or system from different perspectives (views) and can reveal interesting knowledge that is invisible when only one view is considered and analyzed. This has motivated us to continue exploring data from different perspectives in several other studies of this thesis. Domain shift is another common problem when data is obtained from various devices or locations, leading to a drop in the performance of machine learning models if they are not adapted to the current domain (device, location, etc.). The thesis explores the domain adaptation problem in a resource-constraint way using cluster integration techniques. A new hybrid clustering technique for analyzing the heterogeneous data is also proposed. It produces homogeneous groups, facilitating continuous monitoring and fault detection.The algorithms and techniques proposed in this thesis are evaluated on various data sets, including real-world data from industrial partners in domains like smart building systems, smart logistics, and performance monitoring of industrial assets. The obtained results demonstrated the robustness of the algorithms for modeling, analyzing, and mining evolving data streams and/or heterogeneous data. They can adequately adapt single and multi-view clustering models by continuously integrating newly arriving data.
  •  
10.
  • Devagiri, Vishnu Manasa, et al. (author)
  • Multi-view data analysis techniques for monitoring smart building systems
  • 2021
  • In: Sensors. - : MDPI. - 1424-8220. ; 21:20
  • Journal article (peer-reviewed)abstract
    • In smart buildings, many different systems work in coordination to accomplish their tasks. In this process, the sensors associated with these systems collect large amounts of data generated in a streaming fashion, which is prone to concept drift. Such data are heterogeneous due to the wide range of sensors collecting information about different characteristics of the monitored systems. All these make the monitoring task very challenging. Traditional clustering algorithms are not well equipped to address the mentioned challenges. In this work, we study the use of MV Multi-Instance Clustering algorithm for multi-view analysis and mining of smart building systems’ sensor data. It is demonstrated how this algorithm can be used to perform contextual as well as integrated analysis of the systems. Various scenarios in which the algorithm can be used to analyze the data generated by the systems of a smart building are examined and discussed in this study. In addition, it is also shown how the extracted knowledge can be visualized to detect trends in the systems’ behavior and how it can aid domain experts in the systems’ maintenance. In the experiments conducted, the proposed approach was able to successfully detect the deviating behaviors known to have previously occurred and was also able to identify some new deviations during the monitored period. Based on the results obtained from the experiments, it can be concluded that the proposed algorithm has the ability to be used for monitoring, analysis, and detecting deviating behaviors of the systems in a smart building domain. © 2021 by the authors. Licensee MDPI, Basel, Switzerland.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-10 of 14

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view