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

Towards efficient local causal structure learning

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Yang, Shuai Wang, Hao Yu, Kui Cao, Fuyuan Wu, Xindong The School of Computer Science and Information Engineering Hefei University of Technology Hefei230601 China The School of Computer and Information Technology Shanxi University Taiyuan030006 China The Key Laboratory of Knowledge Engineering With Big Data Ministry of Education Hefei University of Technology Hefei230601 China Mininglamp Academy of Sciences Mininglamp Technology Beijing100102 China

Local causal structure learning aims to discover and distinguish direct causes (parents) and direct effects (children) of a variable of interest from data. While emerging successes have been made, existing methods need to search a large space to distinguish direct causes from direct effects of a target variable T. To tackle this issue, we propose a novel Efficient Local Causal Structure learning algorithm, named ELCS. Specifically, we first propose the concept of N-structures, then design an efficient Markov Blanket (MB) discovery subroutine to integrate MB learning with N-structures to learn the MB of T and simultaneously distinguish direct causes from direct effects of T. With the proposed MB subroutine, ELCS starts from the target variable, sequentially finds MBs of variables connected to the target variable and simultaneously constructs local causal structures over MBs until the direct causes and direct effects of the target variable have been distinguished. Using eight Bayesian networks the extensive experiments have validated that ELCS achieves better accuracy and efficiency than the state-of-the-art algorithms. Copyright © 2021, The Authors. All rights reserved.

关键词： Bayesian networks

Automatically Labeling Aging Scenarios with a Machine Learning Approach 1

学校读者我要写书评

暂无评论

24th International Conference on Human-Computer Interaction, HCII 2022

作者： An, Ning Xu, Yang Gao, Qinglin Zhu, Wenjie Wu, Aoran Chen, Honglin School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China Shanghai Tianyu Senior Living Service Co. Ltd. Shanghai China School of Basic Courses Bengbu Medical College Bengbu China Management and Business Department Skidmore College Saratoga SpringsNY United States Department of Social Sciences University of Eastern Finland Kuopio70150 Finland

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

Older adults have diversified needs often associated with particular aging scenarios. People started to use aging scenarios to provide better Smart Eldercare services and develop innovative solutions. The problem is how to manage these scenarios effectively. To our best knowledge, this study is the first to develop a model to provide a structured framework of aging scenarios for research and teaching of eldercare services. Labeling aging scenarios can facilitate their collection, classification, and consolidation within this model. This study uses the automatic labeling approach to manage and utilize aging scenarios. Under each class, there are labels with different numbers and smaller granularity to reflect the requirements in each scenario case. Since a scenario case often involves more than one label, properly labeling it becomes a multi-label text classification problem. We extend the multi-label text classification model LSAN for labeling aging scenario cases. For evaluation purposes, we collected 938 scenario cases as the dataset. Experimental results show that our proposed method can achieve an average accuracy of 61.66%, better than other classical methods. © 2022, Springer Nature Switzerland AG.

关键词： Classification (of information)

Towards Feature Distribution Alignment and Diversity Enhancement for data-Free Quantization

学校读者我要写书评

暂无评论

Towards Feature Distribution Alignment and Diversity Enhance...

IEEE International Conference on data Mining (ICDM)

作者： Yangcheng Gao Zhao Zhang Richang Hong Haijun Zhang Jicong Fan Shuicheng Yan School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China Department of Computer Science Harbin Institute of Technology (Shenzhen) Xili University Town Shenzhen China School of Data Science The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Shenzhen China National University of Singapore Singapore

To obtain lower inference latency and less memory footprint of deep neural networks, model quantization has been widely employed in deep model deployment, by converting the floating points to low-precision integers. However, previous methods (such as quantization aware training and post training quantization) require original data for the fine-tuning or calibration of quantized model, which makes them inapplicable to the cases that original data are not accessed due to privacy or security. This gives birth to the data-free quantization method with synthetic data generation. While current data-free quantization methods still suffer from severe performance degradation when quantizing a model into lower bit, caused by the low inter-class separability of semantic features. To this end, we propose a new and effective data-free quantization method termed ClusterQ, which utilizes the feature distribution alignment for synthetic data generation. To obtain high inter-class separability of semantic features, we cluster and align the feature distribution statistics to imitate the distribution of real data, so that the performance degradation is alleviated. Moreover, we incorporate the diversity enhancement to solve class-wise mode collapse. We also employ the exponential moving average to update the centroid of each cluster for further feature distribution improvement. Extensive experiments based on different deep models (e.g., ResNet-18 and MobileNet-V2) over the ImageNet dataset demonstrate that our proposed ClusterQ model obtains state-of-the-art performance.

关键词： Degradation Training Quantization (signal) Semantics Neural networks Memory management data models

Few-shot Open Relation Extraction with Gaussian Prototype and Adaptive Margin

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Guo, Tianlin Zhang, Lingling Wang, Jiaxin Lei, Yunkuo Li, Yifei Wang, Haofen Liu, Jun School of Computer Science and Technology Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi’an710049 China School of Computer Science and Technology Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi’an710049 China College of Design and Innovation Tongji University Shanghai200092 China

Few-shot relation extraction with none-of-the-above (FsRE with NOTA) aims at predicting labels in few-shot scenarios with unknown classes. FsRE with NOTA is more challenging than the conventional few-shot relation extraction task, since the boundaries of unknown classes are complex and difficult to learn. Meta-learning based methods, especially prototype-based methods, are the mainstream solutions to this task. They obtain the classification boundary by learning the sample distribution of each class. However, their performance is limited because few-shot overfitting and NOTA boundary confusion lead to misclassification between known and unknown classes. To this end, we propose a novel framework based on Gaussian prototype and adaptive margin named GPAM for FsRE with NOTA, which includes three modules, semi-factual representation, GMM-prototype metric learning and decision boundary learning. The first two modules obtain better representations to solve the few-shot problem through debiased information enhancement and Gaussian space distance measurement. The third module learns more accurate classification boundaries and prototypes through adaptive margin and negative sampling. In the training procedure of GPAM, we use contrastive learning loss to comprehensively consider the effects of range and margin on the classification of known and unknown classes to ensure the model's stability and robustness. Sufficient experiments and ablations on the FewRel dataset show that GPAM surpasses previous prototype methods and achieves state-of-the-art performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

Computationally Efficient Approximations for Matrix-based Rényi's Entropy

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Gong, Tieliang Dong, Yuxin Yu, Shujian Dong, Bo The School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an710049 China The Machine Learning Group UiT - The Arctic University of Norway Department of Computer Science Vrije University Amsterdam Amsterdam Netherlands

The recently developed matrix-based Rényi's αorder entropy enables measurement of information in data simply using the eigenspectrum of symmetric positive semi-definite (PSD) matrices in reproducing kernel Hilbert space, without estimation of the underlying data distribution. This intriguing property makes this new information measurement widely adopted in multiple statistical inference and learning tasks. However, the computation of such quantity involves the trace operator on a PSD matrix G to power α (i.e., tr(Gα)), with a normal complexity of nearly O(n3), which severely hampers its practical usage when the number of samples (i.e., n) is large. In this work, we present computationally efficient approximations to this new entropy functional that can reduce its complexity to even significantly less than O(n2). To this end, we leverage the recent progress on Randomized Numerical Linear Algebra, developing Taylor, Chebyshev and Lanczos approximations to tr(Gα) for arbitrary values of α by converting it into a matrix-vector multiplication problem. We also establish the connection between the matrix-based Rényi's entropy and PSD matrix approximation, which enables exploiting both clustering and block low-rank structure of G to further reduce the computational cost. We theoretically provide approximation accuracy guarantees and illustrate the properties for different approximations. Large-scale experimental evaluations on both synthetic and real-world data corroborate our theoretical findings, showing promising speedup with negligible loss in accuracy. Copyright © 2021, The Authors. All rights reserved.

关键词： Matrix algebra

DualConvNet: Enhancing CNN Inference Efficiency Through Compressed Convolutions and Reparameterization

学校读者我要写书评

暂无评论

DualConvNet: Enhancing CNN Inference Efficiency Through Comp...

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Haipeng Du Muyan Jiao Jiageng Zhang Xin Lv Jie Zhang School of Computer Science and Technology Xi’an Jiaotong University Xi’an China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an China School of Continuing Education Xi’an Jiaotong University Xi’an China Network Information Center Xi’an Jiaotong University Xi’an China School of Computer Science and Engineering Xi’an University of Technology Xi’an China

ISBN: (数字)9798331506209

ISBN: (纸本)9798331506216

Convolutional Neural Networks (CNNs) have significantly advanced computer vision tasks, but their increasing complexity poses challenges for efficient inference, particularly on resource-constrained devices. We present DualConvNet, a novel CNN architecture that enhances inference efficiency through two key innovations: compressed convolutions and reparameterization. Compressed convolutions reduce computational complexity by selectively processing input channel subsets during both training and inference. For inference, we introduce a reparameterization technique that merges the multi-branch structure into a single, efficient operation, significantly improving speed. Experiments on CIFAR-10, CIFAR-100, and ImageNet-1k demonstrate DualConvNet’s effectiveness, consistently outperforming state-of-the-art models in both accuracy and inference speed. On the COCO dataset, DualConvNet shows competitive accuracy in object detection and instance segmentation tasks while substantially reducing GPU latency. Ablation studies validate the impact of our dual-strategy approach, revealing significant improvements in both accuracy and computational efficiency compared to alternative designs. These results demonstrate DualConvNet’s effectiveness in improving inference efficiency while maintaining high accuracy across various tasks and datasets, making it particularly suitable for real-time applications in resource-constrained scenarios.

关键词： Training Technological innovation Accuracy Image coding Computational modeling Computer architecture Transformers Computational efficiency Convolutional neural networks Computational complexity

Cloud-assisted Road Condition Monitoring with Privacy Protection in VANETs

学校读者我要写书评

暂无评论

Cloud-assisted Road Condition Monitoring with Privacy Protec...

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Lemei Da Yujue Wang Yong Ding Bo Qin Xiaochun Zhou Hai Liang Huiyong Wang Guangxi Key Laboratory of Cryptography and Information Security School of Computer Science and Information Security Guilin University of Electronic Technology Guilin China Pengcheng Laboratory Cyberspace Security Research Center Shenzhen China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education School of Information Renmin University of China Beijing China Shenzhen Olym Information Security Technology Co. Ltd. Shenzhen China School of Mathematics and Computing Science Guilin University of Electronic Technology Guilin China

Vehicular ad hoc network (VANET) is one of the fastest developing technologies in intelligent transportation systems (ITS), which has made great contributions to improving traffic congestion and reducing traffic accidents. As it is deployed in an open environment, security and privacy are threatened to a certain extent. Moreover, there are huge data exchanges in high traffic areas, which require VANET system to improve computing efficiency while ensuring communication security. To solve the above issues, this paper proposes a cloud-assisted road condition monitoring (RCM) system. The trusted authority (TA) monitors the road conditions with the help of the cloud server. The vehicle collects the road condition information of the road section managed by the roadside unit (RU), and only the vehicles authorized by the administrative roadside unit can successfully upload the road condition reports to the cloud server. The cloud server divides the road condition reports into different equivalence classes, in this way to report the emergency to the TA when the reported quantity exceeds the threshold. Security analysis showed that the proposed RCM system can effectively protect the security and privacy of road condition reports in VANETs.

关键词： Condition monitoring Privacy data privacy Roads Vehicular ad hoc networks Forgery Sensors

Evaluation of China's Digital Economy: A Case Study using Entropy and TOPSIS 11

学校读者我要写书评

暂无评论

Evaluation of China's Digital Economy: A Case Study using En...

11th International Conference on Information Technology and Quantitative Management, ITQM 2024

作者： Liu, Junjie Wang, Boya Xue, Jiayu Qu, Yi Shi, Yong Sino-Danish College University of Chinese Academy of Sciences Beijing100049 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China Faculty of Science and Engineering University of Nottingham Ningbo China Zhejiang Ningbo315100 China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China College of Information Science and Technology University of Nebraska at Omaha OmahaNE68182 United States

Recently, digital economy in social science has become increasingly significant. A well-constructed evaluation structure could generally and promptly describe and reveal its overall social digitalization development. Building on existent researches, this paper improves the evaluation system, which comprises four first-level indicators and thirty-one second-level indicators. Notably, this paper innovatively incorporates higher education into digital innovation of the evaluation. The Entropy method is utilized to assign weights to various indicators in an objective way, with employing the TOPSIS approach to prioritize the development of digital economy in places based on the closeness to the ideal solution. By analysing related data related from 31 provinces in China between 2017 to 2021, this paper greatly finds: Firstly, the development of digital economy vary significantly across provinces, with most provinces at a relatively poor level, indicating considerable potential for overall growth;Secondly, Guangdong, Jiangsu, Zhejiang, and Shandong consistently ranked in the top four from 2017 to 2021, reflecting their specific development attributes and their emphasis on digital economy;Thirdly, significant disparities exist both between regions and among provinces. Consequently, this paper suggests establishing a comprehensive national digital economy development plan, formulating region-specific digital economy policies tailored to local conditions, and encouraging leading provinces to actively share experiences with other provinces. © 2024 The Authors.

关键词： Digital economy Evaluation Multi-source information TOPSIS

Semimetal Contacts to Monolayer Semiconductor: Weak Metalization as an Effective Mechanism to Schottky Barrier Lowering

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Su, Tong Li, Yueyan Wang, Qianqian Zhao, Weiwei Cao, Liemao Ang, Yee Sin Sauvage Laboratory for Smart Materials School of Materials Science and Engineering Harbin Institute of Technology Shenzhen518055 China Shenzhen Key Laboratory of Flexible Printed Electronics Technology Harbin Institute of Technology Shenzhen518055 China Science Mathematics and Technology Singapore University of Technology and Design Singapore487372 Singapore School of Information Management Nanjing University Nanjing210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing210023 China College of Physics and Electronic Engineering Hengyang Normal University Hengyang421002 China

Recent experiment has uncovered semimetal bismuth (Bi) as an excellent electrical contact to monolayer MoS2 with ultralow contact resistance. The contact physics of the broader semimetal/monolayer-semiconductor family beyond Bi/MoS2, however, remains largely unexplored thus far. Here we perform a comprehensive first-principle density functional theory investigation on the electrical contact properties between six archetypal two-dimensional (2D) transition metal dichalcogenide (TMDC) semiconductors, i.e. MoS2, WS2, MoSe2, WSe2, MoTe2 and WTe2, and two representative types of semimetals, Bi and antimony (Sb). As Bi and Sb work functions energetically aligns well with the TMDC conduction band edge, Ohmic or nearly-Ohmic n-type contacts are prevalent. The interlayer distance of semimetal/TMDC contacts are significantly larger than that of the metal/TMDC counterparts, which results in only weak metalization of TMDC upon contact formation. Intriguingly, such weak metalization generates semimetal-induced gap states (MIGS) that extends below the conduction band minimum, thus offering an effective mechanism to reduce or eliminate the n-type Schottky barrier height (SBH) while still preserving the electronic structures of 2D TMDC. A modified Schottky-Mott rule that takes into account SMIGS, interface dipole potential, and Fermi level shifting is proposed, which provides an improved agreement with the DFT-simulated SBH. We further show that the tunneling-specific resistivity of Sb/TMDC contacts are generally lower than the Bi counterparts, thus indicating a better charge injection efficiency can be achieved through Sb contacts. Our findings reveal the promising potential of Bi and Sb as excellent companion electrode materials for advancing 2D semiconductor device technology. Copyright © 2022, The Authors. All rights reserved.

关键词： Molybdenum compounds