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

38th AAAI Conference on Artificial Intelligence, AAAI 2024

作者： Fong, Kei Sen Motani, Mehul Department of Electrical and Computer Engineering National University of Singapore Singapore Institute of Data Science National University of Singapore Singapore

ISBN: (纸本)1577358872

We introduce a conceptually simple yet effective method to create small, compact decision trees – by using splits found via Symbolic Regression (SR). Traditional decision tree (DT) algorithms partition a dataset on axis-parallel splits. When the true boundaries are not along the feature axes, DT is likely to have a complicated structure and a dense decision boundary. In this paper, we introduce SR-Enhanced DT (SREDT) – a method which utilizes SR to increase the richness of the class of possible DT splits. We evaluate SREDT on both synthetic and real-world datasets. Despite its simplicity, our method produces surprisingly small trees that outperform both DT and oblique DT (ODT) on supervised classification tasks in terms of accuracy and F-score. We show empirically that SREDTs decrease inference time (compared to DT and ODT) and argue that they allow us to obtain more explainable descriptions of the decision process. SREDT also performs competitively against state-of-the-art tabular classification methods, including tree ensembles and deep models. Finally, we introduce a local search mechanism to improve SREDT and evaluate it on 56 PMLB datasets. This mechanism shows improved performance on 77.2% of the datasets, outperforming DT and ODT. In terms of F-Score, local SREDT outperforms DT and ODT in 82.5% and 73.7% of the datasets respectively and in terms of inference time, local SREDT requires 25.8% and 26.6% less inference time than DT and ODT respectively. Copyright © 2024, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

A Neural Computing-Based Access Control Protocol for AI-Driven Intelligent Flying Vehicles in Industry 5.0-Assisted Consumer Electronics

引用

IEEE Transactions on Consumer Electronics 2024年第1期70卷 3573-3581页

作者： Mahmood, Khalid Tariq, Tayyaba Sangaiah, Arun Kumar Ghaffar, Zahid Saleem, Muhammad Asad Shamshad, Salman National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Douliu64002 Taiwan National Yunlin University of Science and Technology Department of Computer Science and Information Engineering Douliu64002 Taiwan National Yunlin University of Science and Technology International Graduate School of AI Douliu64002 Taiwan Lebanese American University Department of Electrical and Computer Engineering Byblos1102 2801 Lebanon University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China The University of Lahore Department of Software Engineering Lahore54590 Pakistan

The continuous revolution in Artificial Intelligence (AI) has played a significant role in the development of key consumer applications, including Industry 5.0, autonomous decision-making, fault diagnosis, etc. In practice, autonomous and intelligent robots and flying vehicles (i.e., drones) are also becoming the integral part of Industry 5.0. These vehicles are attaining significant importance nowadays because of their applications in consumer electronics. However, there may be numerous privacy issues in such an infrastructure. Nevertheless, neural computing-driven security solutions have played a significant role in overcoming the security and privacy issues of AI-driven intelligent flying vehicles. Motivated by these facts, this article presents a neural computing-based access control protocol for AI-driven flying vehicles to prevent all possible security threats. A detailed security evaluation of the devised protocol is done formally using the extensively recognized Real-Or-Random (ROR) oracle model. Similarly, the informal security analysis ensures the resistance of our scheme against various potential attacks under the assumptions of CK and DY adversarial models. Moreover, detailed performance scrutiny of the devised protocol with various existing schemes shows the robustness and supremacy of our scheme in terms of computation, communication overhead, and security attributes. © 1975-2011 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

In-Context Learning with Representations: Contextual Generalization of Trained Transformers 38

In-Context Learning with Representations: Contextual General...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Yang, Tong Huang, Yu Liang, Yingbin Chi, Yuejie Department of Electrical and Computer Engineering Carnegie Mellon University United States Department of Statistics and Data Science Wharton School University of Pennsylvania United States Department of Electrical and Computer Engineering The Ohio State University United States

In-context learning (ICL) refers to a remarkable capability of pretrained large language models, which can learn a new task given a few examples during inference. However, theoretical understanding of ICL is largely under-explored, particularly whether transformers can be trained to generalize to unseen examples in a prompt, which will require the model to acquire contextual knowledge of the prompt for generalization. This paper investigates the training dynamics of transformers by gradient descent through the lens of non-linear regression tasks. The contextual generalization here can be attained via learning the template function for each task in-context, where all template functions lie in a linear space with m basis functions. We analyze the training dynamics of one-layer multi-head transformers to in-contextly predict unlabeled inputs given partially labeled prompts, where the labels contain Gaussian noise and the number of examples in each prompt are not sufficient to determine the template. Under mild assumptions, we show that the training loss for a one-layer multi-head transformer converges linearly to a global minimum. Moreover, the transformer effectively learns to perform ridge regression over the basis functions. To our knowledge, this study is the first provable demonstration that transformers can learn contextual (i.e., template) information to generalize to both unseen examples and tasks when prompts contain only a small number of query-answer pairs. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

OUT-OF-DOMAIN UNLABELED data IMPROVES GENERALIZATION 12

OUT-OF-DOMAIN UNLABELED DATA IMPROVES GENERALIZATION

引用

12th International Conference on Learning Representations, ICLR 2024

作者： Saberi, Amir Hossein Movasaghinia, Mohammad Hosein Najafi, Amir Motahari, Seyed Abolfazl Heidari, Alireza Khalaj, Babak H. Department of Electrical Engineering Department of Computer Engineering Sharif Center for Information Systems and Data Science Iran Sharif Institute for Convergence Science & Technology Sharif University of Technology Tehran Iran

We propose a novel framework for incorporating unlabeled data into semi-supervised classification problems, where scenarios involving the minimization of either i) adversarially robust or ii) non-robust loss functions have been considered. Notably, we allow the unlabeled samples to deviate slightly (in total variation sense) from the in-domain distribution. The core idea behind our framework is to combine Distributionally Robust Optimization (DRO) with self-supervised training. As a result, we also leverage efficient polynomial-time algorithms for the training stage. From a theoretical standpoint, we apply our framework on the classification problem of a mixture of two Gaussians in Rd, where in addition to the m independent and labeled samples from the true distribution, a set of n (usually with n m) out of domain and unlabeled samples are given as well. Using only the labeled data, it is known that the generalization error can be bounded by ∝ (d/m)1/2. However, using our method on both isotropic and non-isotropic Gaussian mixture models, one can derive a new set of analytically explicit and non-asymptotic bounds which show substantial improvement on the generalization error compared to ERM. Our results underscore two significant insights: 1) out-of-domain samples, even when unlabeled, can be harnessed to narrow the generalization gap, provided that the true data distribution adheres to a form of the "cluster assumption", and 2) the semi-supervised learning paradigm can be regarded as a special case of our framework when there are no distributional shifts. We validate our claims through experiments conducted on a variety of synthetic and real-world datasets. © 2024 12th International Conference on Learning Representations, ICLR 2024. All rights reserved.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Advancements in Liver Tumor Detection:A Comprehensive Review of Various Deep Learning Models

引用

computer Modeling in engineering & sciences 2025年第1期142卷 91-122页

作者： Shanmugasundaram Hariharan D.Anandan Murugaperumal Krishnamoorthy Vinay Kukreja Nitin Goyal Shih-Yu Chen Deptartment of Artificial Intelligence and Data Science Vardhaman College of EngineeringHyderabad501218India Deptartment of CSE V.S.B College of EngineeringKarur639111India Deptartment of Electrical and Electronics Engineering Vardhaman College of EngineeringHyderabad501218India Centre for Research Impact&Outcome Chitkara UniversityRajpura140401PunjabIndia Department of Computer Science and Engineering School of Engineering and TechnologyCentral University of HaryanaMahendergarh123031HaryanaIndia Department of Computer Science and Information Engineering National Yunlin University of Science and TechnologyYunlin64002Taiwan Intelligence Recognition Industry Service Research Center National Yunlin University of Science and TechnologyYunlin64002Taiwan

Liver cancer remains a leading cause of mortality worldwide,and precise diagnostic tools are essential for effective treatment *** Tumors(LTs)vary significantly in size,shape,and location,and can present with tissues of similar intensities,making automatically segmenting and classifying LTs from abdominal tomography images crucial and *** review examines recent advancements in Liver Segmentation(LS)and Tumor Segmentation(TS)algorithms,highlighting their strengths and limitations regarding precision,automation,and *** metrics are utilized to assess key detection algorithms and analytical methods,emphasizing their effectiveness and relevance in clinical *** review also addresses ongoing challenges in liver tumor segmentation and identification,such as managing high variability in patient data and ensuring robustness across different imaging *** suggests directions for future research,with insights into technological advancements that can enhance surgical planning and diagnostic accuracy by comparing popular *** paper contributes to a comprehensive understanding of current liver tumor detection techniques,provides a roadmap for future innovations,and improves diagnostic and therapeutic outcomes for liver cancer by integrating recent progress with remaining challenges.

关键词： Liver tumor detection liver tumor segmentation image processing liver tumor diagnosis feature extraction tumor classification deep learning machine learning

来源：评论

学校读者我要写书评

暂无评论

VaeDiff-DocRE: End-to-end data Augmentation Framework for Document-level Relation Extraction 31

VaeDiff-DocRE: End-to-end Data Augmentation Framework for Do...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Tran, Khai Phan Hua, Wen Li, Xue School of Electrical Engineering and Computer Science The University of Queensland Australia Department of Data Science and Artificial Intelligence The Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9798891761964

Document-level Relation Extraction (DocRE) aims to identify relationships between entity pairs within a document. However, most existing methods assume a uniform label distribution, resulting in suboptimal performance on real-world, imbalanced datasets. To tackle this challenge, we propose a novel data augmentation approach using generative models to enhance data from the embedding space. Our method leverages the Variational Autoencoder (VAE) architecture to capture all relation-wise distributions formed by entity pair representations and augment data for underrepresented relations. To better capture the multi-label nature of DocRE, we parameterize the VAE's latent space with a Diffusion Model. Additionally, we introduce a hierarchical training framework to integrate the proposed VAE-based augmentation module into DocRE systems. Experiments on two benchmark datasets demonstrate that our method outperforms state-of-the-art models, effectively addressing the long-tail distribution problem in DocRE. Our code is released at: https://***/khaitran22/VaeDiff-DocRE. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Towards Better Accuracy-Efficiency Trade-Offs: Dynamic Activity Inference via Collaborative Learning From Various Width-Resolution Configurations

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第12期5卷 6723-6738页

作者： Qin, Lutong Zhang, Lei Li, Chengrun Song, Chaoda Cheng, Dongzhou Wang, Shuoyuan Wu, Hao Song, Aiguo Nanjing Normal University School of Electrical and Automation Engineering Nanjing210023 China Shanghai200240 China Case Western Reserve University Department of Computer and Data Sciences ClevelandOH44106 United States University of Macau Department of Computer and Information Science Taipa999078 China Yunnan University School of Information Science and Engineering Kunming650500 China Southeast University Department of Instrument Science and Engineering Nanjing210096 China

Recently, deep neural networks have triumphed over a large variety of human activity recognition (HAR) applications on resource-constrained mobile devices. However, most existing works are static and ignore the fact that the computational budget usually changes drastically across various devices, which prevent real-world HAR deployment. It still remains a major challenge: how to adaptively and instantly tradeoff accuracy and latency at runtime for on-device activity inference using time series sensor data? To address this issue, this article introduces a new collaborative learning scheme by training a set of subnetworks executed at varying network widths when fueled with different sensor input resolutions as data augmentation, which can instantly switch on-the-fly at different width-resolution configurations for flexible and dynamic activity inference under varying resource budgets. Particularly, it offers a promising performance-boosting solution by utilizing self-distillation to transfer the unique knowledge among multiple width-resolution configuration, which can capture stronger feature representations for activity recognition. Extensive experiments and ablation studies on three public HAR benchmark datasets validate the effectiveness and efficiency of our approach. A real implementation is evaluated on a mobile device. This discovery opens up the possibility to directly access accuracy-latency spectrum of deep learning models in versatile real-world HAR deployments. © 2020 IEEE.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Enhancing Residential Real Estate Search with Classification Strategies Using Diffusion and CLIP

Enhancing Residential Real Estate Search with Classification...

引用

2024 IEEE International Conference on Consumer Electronics, ICCE 2024

作者： Deng, Haojin Zhang, Wandong Yang, Yimin Nejad, Eman Western University Department of Electrical and Computer Engineering London Canada Wahi Realty Inc. Data Science Toronto Canada

ISBN: (纸本)9798350324136

The significance of the real estate search engine in the economy necessitates the development of a reliable room image luxury level annotation method that addresses current limitations, including the inability to assess room quality, underutilization of deep network capacities, and the need for more annotated house images. This paper proposes a novel real estate image annotation model, leveraging the diffusion model and contrastive language-image pre-Training (CLIP) network, through a multi-stage algorithm. First, the diffusion network is employed as a data augmentation technique to generate additional real estate images for network training. Then, a CLIP model is utilized to categorize images into the kitchen, bathroom, dining room, living room, and foyer. Finally, five CLIP models assess the condition of each room, categorizing it as contemporary and standard. Experimental results on a newly collected real estate image dataset demonstrate that the proposed approach surpasses existing house image classification algorithms. © 2024 IEEE.

关键词： contrastive language-image pre-Training image classification luxury level annotation Real-estate image

来源：评论

学校读者我要写书评

暂无评论

Drawing Order Diagrams Through Two-Dimension Extension

引用

Journal of Graph Algorithms and Applications 2023年第9期27卷 783-802页

作者： Dürrschnabel, Dominik Hanika, Tom Stumme, Gerd Knowledge & Data Engineering Group Research Center for Information System Design & Department of Electrical Engineering and Computer Science University of Kassel Germany Institute of Computer Science University of Hildesheim Germany Berlin School of Library and Information Science Humboldt-Universität zu Berlin Germany

Ordinal real-world data such as concept hierarchies, ontologies, genealogies, or task dependencies in scheduling often has the property to not only contain pairwise comparable, but also incomparable elements. Order diagrams provide an important tool for understanding and thus discovering knowledge in such data. Easily readable drawings of such order diagrams are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work, we present the novel algorithm DimDraw to decompose an ordered set (e.g., a concept hierarchy) in linear orders and to produce a corresponding order diagram. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of its transitive incompatibility graph. To evaluate the quality of the algorithm, a user study was conducted where generated drawings were compared with ones from state-of-the-art drawing algorithms. © 2023 Brown University. All rights reserved.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

AKDC: Ambiguous Kernel Distance Clustering Algorithm for COVID-19 CT Scans Analysis

引用

IEEE Transactions on Systems, Man, and Cybernetics: Systems 2024年第10期54卷 6218-6229页

作者： Singh, Pritpal Huang, Yo-Ping The Quantum Optimization Research Lab Department of Data Science and Analytics Central University of Rajasthan Ajmer305817 India National Taipei University of Technology Department of Electrical Engineering Taipei10608 Taiwan National Taipei University Department of Computer Science and Information Engineering New Taipei City23741 Taiwan Chaoyang University of Technology Department of Information and Communication Engineering Taichung41349 Taiwan

Conventional soft clustering algorithms perform well on linearly distributed features, but their performance degrades on nonlinearly distributed features in high-dimensional space. In this study, a novel soft clustering algorithm, the ambiguous kernel distance clustering (AKDC) algorithm, is presented. This algorithm is developed by applying ambiguous set theory and the Gaussian kernel function. The ambiguous set theory defines the ambiguities inherent in each feature with four membership values: 1) true;2) false;3) true-ambiguous;and 4) false-ambiguous. The degree of membership values here forms a low-dimensional feature space that is not linearly distributed. Therefore, these nonlinearly distributed membership values are mapped into a high-dimensional feature space using the Gaussian kernel function. This study focuses on performing cluster analysis of computerized tomography scans of COVID-19 (CTSC-19) cases using AKDC. COVID-19, recognized as one of the most life-threatening diseases of this century, is highly contagious, and early diagnosis may prevent one-to-one transmission. Extensive empirical studies have been conducted with different types of CTSC-19 to demonstrate its effectiveness against existing kernel-based clustering and nonkernel-based clustering algorithms, namely mercer kernel fuzzy c-mean (MKFCM), kernel generalized FCM (KGFCM), kernel intuitionistic fuzzy entropy c-means (KIFECMs), morphological reconstruction and membership filtering clustering (FRFCM), and intuitionistic FCM based on membership information transferring and similarity measurements (IFCM-MS). The effectiveness of the proposed algorithm compared to the existing algorithms is evaluated using standard statistical metrics, such as dice index (DI), Jaccard index (JI), structural similarity index (SI), and correlation coefficient (CC). The empirical results show that AKDC is more effective than existing algorithms based on DI, JI, SI, and CC. © 2013 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：