检索结果-内蒙古大学图书馆

Sustainable Computing and Smart Systems (ICSCSS), International Conference on

作者： S. Saravanan K. Muthumanickam N. Subha P.C.Senthil Mahesh Department of CSE-Data Science Dayananda Sagar Academy of Technology and Management Bengaluru India Department of Information Technology Kongunadu College of Engineering and Technology (Autonomous) Thottiyam Tamilnadu India Department of Computer Science and Engineering Knowledge Institute of Technology Salem Tamilnadu India Department of Computer Science and Engineering Excel Engineering College Komarapalayam Tamilnadu India

ISBN: (数字)9798350379990

ISBN: (纸本)9798350391558

The neurodegenerative disease known as Alzheimer's disease (AD), which affects people worldwide, is complicated to treat and expensive. Conventional approaches, including manual Support Vector Machine (SVM) based methods with separate feature extraction and preprocessing, lack automation and pose limitations. This project recognizes the pressing need for efficient and automated solutions. Building on existing work that employed SVM and manual processing for Alzheimer's diagnosis, this work proposes a novel approach. Utilizing brain MRI scans and the VGG16 architecture, our automated system achieves high accuracy in predicting both labeled and unlabeled data. The integration of VGG16 ensures a streamlined process, eliminating manual intervention in feature extraction and preprocessing. This automation enhances accessibility, reduces costs, and offers a user-friendly interface for users. In contrast to traditional methods, our proposed system allows users to input MRI scans, facilitating prompt and accurate predictions. Upon analysis, the proposed system provides doctor recommendations and suggests prescriptions. The VGG16-based approach not only ensures superior diagnostic accuracy but also streamlines the entire process, emphasizing the importance of early detection for improved outcomes in Alzheimer's disease management.

关键词： Support vector machines Accuracy Automation Magnetic resonance imaging Manuals Pressing Streaming media

来源：评论

学校读者我要写书评

暂无评论

SHLE: Devices Tracking and Depth Filtering for Stereo-based Height Limit Estimation

arXiv

引用

arXiv 2022年

作者： Fan, Zhaoxin Yang, Kaixing Zhang, Min Song, Zhenbo Liu, Hongyan He, Jun Key Laboratory of Data Engineering and Knowledge Engineering of MOE School of Information Renmin University of China Beijing100872 China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Department of Management Science and Engineering Tsinghua University Beijing100084 China

Recently, over-height vehicle strike frequently occurs, causing great economic cost and serious safety problems. Hence, an alert system which can accurately discover any possible height limiting devices in advance is necessary to be employed in modern large or medium sized cars, such as touring cars. Detecting and estimating the height limiting devices act as the key point of a successful height limit alert system. Though there are some works research height limit estimation, existing methods are either too computational expensive or not accurate enough. In this paper, we propose a novel stereo-based pipeline named SHLE for height limit estimation. Our SHLE pipeline consists of two stages. In stage 1, a novel devices detection and tracking scheme is introduced, which accurately locate the height limit devices in the left or right image. Then, in stage 2, the depth is temporally measured, extracted and filtered to calculate the height limit device. To benchmark the height limit estimation task, we build a large-scale dataset named "Disparity Height", where stereo images, pre-computed disparities and ground-truth height limit annotations are provided. We conducted extensive experiments on "Disparity Height" and the results show that SHLE achieves an average error below than 10cm though the car is 70m away from the devices. Our method also outperforms all compared baselines and achieves state-of-the-art performance. Code is available at https://***/Yang-Kaixing/SHLE. Copyright © 2022, The Authors. All rights reserved.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Pancreatic Cancer Prediction Machine Learning using Multi Fusion Model

Pancreatic Cancer Prediction Machine Learning using Multi Fu...

引用

Distributed Systems, Computer Networks and Cybersecurity (ICDSCNC), International Conference on

作者： V. Sathiyapriya K. Nethra Devi S. Deepa M. Marimuthu P. Manikandan S. Prabu Department of Computer Science and Engineering Knowledge Institute of Technology Kakapalayam India Department of Artificial Intelligence and Data Science Gnanamani College of Technology Namakkal India School of Computer Science and Engineering Vellore Institute of Technology Chennai India School of Computing SRM Institute of Science and Technology Tiruchirappalli India

ISBN: (数字)9798350375442

ISBN: (纸本)9798350375459

Pancreatic cancer poses a significant challenge in early detection and treatment due to its malignant nature within the digestive tract. Recent studies, such as those conducted by the Pancreatic Cancer Action Network, predict that pancreatic cancer will rank as the world's second leading cause of cancer-related deaths in 2020. Various methods have been explored in the literature to segment pancreatic tumors and detect lesions from CT images, crucial for assessing severity. One such method is the Min-Max segmentation algorithm, which effectively removes the jaundiced sclera region from affected eyes by analysing color gradients, offering more feasible and discriminative solutions. Additionally, the utilization of Whale Optimized feature-based selection aids in extracting optimal features for optimization purposes. Through an analysis of different classification algorithms and the implementation of a suggested technique for achieving optimum solutions and maximum accuracy, the proposed work is structured into two phases. Phase I involves pre-processing and artifact removal, followed by segmentation, while Phase II focuses on feature extraction, feature selection, and classification. The initial step of pre-processing the image facilitates pixel location using intensity measures, crucial for accurate tumor segmentation and minimizing false detection. Ultimately, the proposed approach aims to design and develop an optimal feature selection strategy for classifying pancreatic cancer tumors in PET/CT images, resulting in increased classification efficiency 92% and improved cancer tumor detection rates with compare other existing approaches.

关键词： Image segmentation Accuracy Soft sensors Pancreatic cancer Medical services Feature extraction Prediction algorithms Whale optimization algorithms Classification algorithms Ensemble learning

来源：评论

学校读者我要写书评

暂无评论

Semantics, Web and Mining 1

引用

丛书名： Lecture Notes in Computer science

1000年

作者： Markus Ackermann Bettina Berendt Marko Grobelnik Andreas Hotho Dunja Mladenič Giovanni Semeraro Myra Spiliopoulou Gerd Stumme Vojtěch Svátek Maarten Someren

ISBN: (数字)9783540476986

ISBN: (纸本)9783540476979

Finding knowledge – or meaning – in data is the goal of every knowledge d- covery e?ort. Subsequent goals and questions regarding this knowledge di?er amongknowledgediscovery(KD) projectsandapproaches. Onecentralquestion is whether and to what extent the meaning extracted from the data is expressed in a formal way that allows not only humans but also machines to understand and re-use it, i. e. , whether the semantics are formal semantics. Conversely, the input to KD processes di?ers between KD projects and approaches. One central questioniswhetherthebackgroundknowledge,businessunderstanding,etc. that the analyst employs to improve the results of KD is a set of natural-language statements, a theory in a formal language, or somewhere in between. Also, the data that are being mined can be more or less structured and/or accompanied by formal semantics. These questions must be asked in every KD e?ort. Nowhere may they be more pertinent, however, than in KD from Web data (“Web mining”). Thisis due especially to the vast amounts and heterogeneity of data and ba- ground knowledge available for Web mining (content, link structure, and - age), and to the re-use of background knowledge and KD results over the Web as a global knowledge repository and activity space. In addition, the (Sem- tic) Web can serve as a publishing space for the results of knowledge discovery from other resources, especially if the whole process is underpinned by common ontologies.

关键词： Artificial Intelligence Computer Communication Networks database Management Information Storage and Retrieval Information Systems Applications (incl. Internet) Computers and Society

来源：评论

学校读者我要写书评

暂无评论

Chinese Lexical Simplification

引用

IEEE/ACM Transactions on Audio Speech and Language Processing 2021年 29卷 1819-1828页

作者： Qiang, Jipeng Lu, Xinyu Li, Yun Yuan, Yunhao Wu, Xindong Department of Computer Science Yangzhou China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei China

Lexical simplification has attracted much attention in many languages, which is the process of replacing complex words in a given sentence with simpler alternatives of equivalent meaning. Although the richness of vocabulary in Chinese makes the text very difficult to read for children and non-native speakers, there is no research work for the Chinese lexical simplification (CLS) task. To circumvent difficulties in acquiring annotations, we manually create the first benchmark dataset for CLS, which can be used for evaluating the lexical simplification systems automatically. To acquire a more thorough comparison, we present five different types of methods as baselines to generate substitute candidates for the complex word that includes synonym-based approach, word embedding-based approach, BERT-based approach, sememe-based approach, and a hybrid approach. Finally, we design the experimental evaluation of these baselines and discuss their advantages and disadvantages. To our best knowledge, this is the first study for CLS task. © 2014 IEEE.

关键词： BERT Lexical simplification pretrained language model unsupervised

来源：评论

学校读者我要写书评

暂无评论

SHREC'16 Track: Partial Shape Queries for 3D object retrieval 9

SHREC'16 Track: Partial Shape Queries for 3D object retrieva...

引用

9th Eurographics Workshop on 3D Object Retrieval, 3DOR 2016

作者： Pratikakis, I. Savelonas, M.A. Arnaoutoglou, F. Ioannakis, G. Koutsoudis, A. Theoharis, T. Tran, M.-T. Nguyen, V.-T. Pham, V.-K. Nguyen, H.-D. Le, H.-A. Tran, B.-H. To, Q.H. Truong, M.-B. Phan, T.V. Nguyen, M.-D. Than, T.-A. Mac, K.-N.C. Do, M.N. Duong, A.-D. Furuya, T. Ohbuchi, R. Aono, M. Tashiro, S. Pickup, D. Sun, X. Rosin, P.L. Martin, R.R. Democritus University of Thrace Department of Electrical and Computer Engineering Greece ATHENA Research Center Institute for Language and Speech Processing Greece Norwegian University of Science and Technology Department of Computer and Information Science Norway University of Science VNU-HCM Viet Nam University of Science University of Information Technology VNU-HCM Viet Nam University of Science John von Neumann Institute VNU-HCM Viet Nam University of Illinois Urbana-Champaign United States University of Information Technology VNU-HCM Viet Nam Graduate School of Medicine and Engineering University of Yamanashi Japan Knowledge Data Engineering Lab. Toyohashi University of Technology Japan School of Computer Science and Informatics Cardiff University United Kingdom

ISBN: (纸本)9783038680048

Despite numerous recent efforts, 3D object retrieval based on partial shape queries remains a challenging problem, far from being solved. The problem can be defined as: given a partial view of a shape as query, retrieve all partially similar 3D models from a repository. The objective of this track is to evaluate the performance of partial 3D object retrieval methods, for partial shape queries of various scan qualities and degrees of partiality. The retrieval problem is often found in cultural heritage applications, for which partial scans of objects query a dataset of geometrically distinct classes. © 2016 The Eurographics Association.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On Aggregation in Ensembles of Multilabel Classifiers

arXiv

引用

arXiv 2020年

作者： Nguyen, Vu-Linh Hüllermeier, Eyke Rapp, Michael Mencía, Eneldo Loza Fürnkranz, Johannes Heinz Nixdorf Institute Department of Computer Science Paderborn University Germany Knowledge Engineering Group TU Darmstadt Germany Computational Data Analytics Group JKU Linz Austria

While a variety of ensemble methods for multilabel classification have been proposed in the literature, the question of how to aggregate the predictions of the individual members of the ensemble has received little attention so far. In this paper, we introduce a formal framework of ensemble multilabel classification, in which we distinguish two principal approaches: "predict then combine" (PTC), where the ensemble members first make loss minimizing predictions which are subsequently combined, and "combine then predict" (CTP), which first aggregates information such as marginal label probabilities from the individual ensemble members, and then derives a prediction from this aggregation. While both approaches generalize voting techniques commonly used for multilabel ensembles, they allow to explicitly take the target performance measure into account. Therefore, concrete instantiations of CTP and PTC can be tailored to concrete loss functions. Experimentally, we show that standard voting techniques are indeed outperformed by suitable instantiations of CTP and PTC, and provide some evidence that CTP performs well for decomposable loss functions, whereas PTC is the better choice for non-decomposable losses. Copyright © 2020, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

ARCH-COMP23 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics 10th

ARCH-COMP23 Category Report: Continuous and Hybrid Systems w...

引用

10th International Workshop on Applied Verification of Continuous and Hybrid Systems, ARCH 2023

作者： Geretti, Luca dit Sandretto, Julien Alexandre Althoff, Matthias Benet, Luis Collins, Pieter Forets, Marcelo Ivanova, Elena Li, Yangge Mitra, Sayan Mitsch, Stefan Schilling, Christian Wetzlinger, Mark Zhuang, Daniel Department of Electrical and Computer Engineering University of Southern California Los AngelesCA United States ENSTA Paris Institut Polytechnique de Paris Palaiseau France Technische Universität München Munich Germany Mexico Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands Universidad de la Repúblic Montevideo Uruguay Computer Science Department Carnegie Mellon University PittsburghPA United States Aalborg University Aalborg Denmark University of Illinois Urbana-Champaign United States

We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2023. This year, 6 tools participated: Ariadne, CORA, DynIbex, JuliaReach, KeYmaera X and Verse (in alphabetic order). These tools are applied to solve reachability analysis problems on six benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools. © 2023, EasyChair. All rights reserved.

关键词： Hybrid systems

来源：评论

学校读者我要写书评

暂无评论

A relaxed-inertial forward-backward-forward algorithm for stochastic generalized Nash equilibrium seeking

arXiv

引用

arXiv 2021年

作者： Cui, Shisheng Franci, Barbara Grammatico, Sergio Shanbhag, Uday V. Staudigl, Mathias Department of Industrial and Manufacturing Engineering Pennsylvania State University University ParkPA16802 United States Delft Center for System and Control TU Delft Netherlands Department of Data Science and Knowledge Engineering Maastricht University Netherlands

In this paper we propose a new operator splitting algorithm for distributed Nash equilibrium seeking under stochastic uncertainty, featuring relaxation and inertial effects. Our work is inspired by recent deterministic operator splitting methods, designed for solving structured monotone inclusion problems. The algorithm is derived from a forward-backward-forward scheme for solving structured monotone inclusion problems featuring a Lipschitz continuous and monotone game operator. To the best of our knowledge, this is the first distributed (generalized) Nash equilibrium seeking algorithm featuring acceleration techniques in stochastic Nash games without assuming cocoercivity. Numerical examples illustrate the effect of inertia and relaxation on the performance of our proposed algorithm. © 2021, CC BY.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

An Empirical Examination of Balancing Strategy for Counterfactual Estimation on Time Series 41

An Empirical Examination of Balancing Strategy for Counterfa...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Huang, Qiang Meng, Chuizheng Cao, Defu Huang, Biwei Chang, Yi Liu, Yan School of Artificial Intelligence Jilin University Jilin Changchun China International Center of Future Science Jilin University Jilin Changchun China Department of Computer Science University of Southern California California Los Angeles United States Halicioğlu Data Science Institute University of California San Diego San DiegoCA United States Engineering Research Center of Knowledge-Driven Human-Machine Intelligence MOE Jilin Changchun China

Counterfactual estimation from observations represents a critical endeavor in numerous application fields, such as healthcare and finance, with the primary challenge being the mitigation of treatment bias. The balancing strategy aimed at reducing covariate disparities between different treatment groups serves as a universal solution. However, when it comes to the time series data, the effectiveness of balancing strategies remains an open question, with a thorough analysis of the robustness and applicability of balancing strategies still lacking. This paper revisits counterfactual estimation in the temporal setting and provides a brief overview of recent advancements in balancing strategies. More importantly, we conduct a critical empirical examination for the effectiveness of the balancing strategies within the realm of temporal counterfactual estimation in various settings on multiple datasets. Our findings could be of significant interest to researchers and practitioners and call for a reexamination of the balancing strategy in time series settings. Copyright 2024 by the author(s)

关键词： Time series analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：