作者:
Pokale, KomalChaudhri, Shiv Nath
Department of Artificial Intelligence and Data Science Maharashtra India
Department of Computer Science and Design Maharashtra India
Fine-tuning a pre-trained model is a type of transfer learning: a pre-trained model that works on a large dataset is transferred onto a particular task or a smaller dataset, such as a hyperspectral image. The efficacy...
详细信息
This study addresses gastrointestinal cancer radiation therapy challenges by implementing advanced deep learning techniques. We focus on automating manual segmentation tasks during treatment planning to enhance effici...
详细信息
Question-answering(QA)models find answers to a given *** necessity of automatically finding answers is increasing because it is very important and challenging from the large-scale QA data *** this paper,we deal with t...
详细信息
Question-answering(QA)models find answers to a given *** necessity of automatically finding answers is increasing because it is very important and challenging from the large-scale QA data *** this paper,we deal with the QA pair matching approach in QA models,which finds the most relevant question and its recommended answer for a given *** studies for the approach performed on the entire dataset or datasets within a category that the question writer manually *** contrast,we aim to automatically find the category to which the question belongs by employing the text classification model and to find the answer corresponding to the question within the *** to the text classification model,we can effectively reduce the search space for finding the answers to a given ***,the proposed model improves the accuracy of the QA matching model and significantly reduces the model inference ***,to improve the performance of finding similar sentences in each category,we present an ensemble embedding model for sentences,improving the performance compared to the individual embedding *** real-world QA data sets,we evaluate the performance of the proposed QA matching *** a result,the accuracy of our final ensemble embedding model based on the text classification model is 81.18%,which outperforms the existing models by 9.81%∼14.16%***,in terms of the model inference speed,our model is faster than the existing models by 2.61∼5.07 times due to the effective reduction of search spaces by the text classification model.
Recent studies have highlighted the issue of Pretrained Language Models (PLMs) inadvertently propagating social stigmas and stereotypes, a critical concern given their widespread use. This is particularly problematic ...
详细信息
Theoretical studies on the representation power of GNNs have been centered around understanding the equivalence of GNNs, using WL-Tests for detecting graph isomorphism. In this paper, we argue that such equivalence ig...
详细信息
作者:
Nayomi, B.Deena DivyaJyothsna, V.
Department of Computer Science and Engineering Andhra Pradesh Tirupati India
Department of Data Science Andhra Pradesh Tirupati India
This research study presents a thorough examination of the application of deep learning techniques in enhancing node position prediction within Vehicular Ad-Hoc Networks (VANETs). As VANETs become increasingly integra...
详细信息
We study the problem of estimating the score function of an unknown probability distribution ρ∗ from n independent and identically distributed observations in d dimensions. Assuming that ρ∗ is subgaussian and has a ...
详细信息
When data privacy is imposed as a necessity,Federated learning(FL)emerges as a relevant artificial intelligence field for developing machine learning(ML)models in a distributed and decentralized *** allows ML models t...
详细信息
When data privacy is imposed as a necessity,Federated learning(FL)emerges as a relevant artificial intelligence field for developing machine learning(ML)models in a distributed and decentralized *** allows ML models to be trained on local devices without any need for centralized data transfer,thereby reducing both the exposure of sensitive data and the possibility of data interception by malicious third *** paradigm has gained momentum in the last few years,spurred by the plethora of real-world applications that have leveraged its ability to improve the efficiency of distributed learning and to accommodate numerous participants with their data *** virtue of FL,models can be learned from all such distributed data sources while preserving data *** aim of this paper is to provide a practical tutorial on FL,including a short methodology and a systematic analysis of existing software ***,our tutorial provides exemplary cases of study from three complementary perspectives:i)Foundations of FL,describing the main components of FL,from key elements to FL categories;ii)Implementation guidelines and exemplary cases of study,by systematically examining the functionalities provided by existing software frameworks for FL deployment,devising a methodology to design a FL scenario,and providing exemplary cases of study with source code for different ML approaches;and iii)Trends,shortly reviewing a non-exhaustive list of research directions that are under active investigation in the current FL *** ultimate purpose of this work is to establish itself as a referential work for researchers,developers,and data scientists willing to explore the capabilities of FL in practical applications.
Rtecently a lot of works have been investigating to find the tenuous groups,i.e.,groups with few social interactions and weak relationships among members,for reviewer selection and psycho-educational group ***,the met...
详细信息
Rtecently a lot of works have been investigating to find the tenuous groups,i.e.,groups with few social interactions and weak relationships among members,for reviewer selection and psycho-educational group ***,the metrics(e.g.,k-triangle,k-line,and k-tenuity)used to measure the tenuity,require a suitable k value to be specified which is difficult for users without background ***,in this paper we formulate the most tenuous group(MTG)query in terms of the group distance and average group distance of a group measuring the tenuity to eliminate the influence of parameter k on the tenuity of the *** address the MTG problem,we first propose an exact algorithm,namely MTGVDIS,which takes priority to selecting those vertices whose vertex distance is large,to generate the result group,and also utilizes effective filtering and pruning *** MTGVDIS is not fast enough,we design an efficient exact algorithm,called MTG-VDGE,which exploits the degree metric to sort the vertexes and proposes a new combination order,namely degree and reverse based branch and bound(DRBB).MTG-VDGE gives priority to those vertices with small *** a large p,we further develop an approximation algorithm,namely MTG-VDLT,which discards candidate attendees with high degree to reduce the number of vertices to be *** experimental results on real datasets manifest that the proposed algorithms outperform existing approaches on both efficiency and group tenuity.
Since the inception of the Internet and WWW, providing the time among multiple nodes on the Internet has been one of the most critical challenges. David Mills is the pioneer to provide time on the Internet, inventing ...
详细信息
暂无评论