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

33rd ACM Web Conference, WWW 2024

作者： Li, Jiatong Liu, Qi Wang, Fei Liu, Jiayu Huang, Zhenya Yao, Fangzhou Zhu, Linbo Su, Yu University of Science and Technology of China Anhui Province Key Laboratory of Big Data Analysis and Application State Key Laboratory of Cognitive Intelligence Hefei China University of Science and Technology of China School of Computer Science and Technology Hefei Comprehensive National Science Center Institute of Artificial Intelligence Hefei China Hefei Normal University Hefei Comprehensive National Science Center Institute of Artificial Intelligence Hefei China

ISBN: (纸本)9798400701719

Personalized learner modeling using cognitive diagnosis (CD), which aims to model learners' cognitive states by diagnosing learner traits from behavioral data, is a fundamental yet significant task in many web learning services. Existing cognitive diagnosis models (CDMs) follow theproficiency-response paradigm that views learner traits and question parameters as trainable embeddings and learns them through learner performance prediction. However, we notice that this paradigm leads to the inevitable non-identifiability and explainability overfitting problem, which is harmful to the quantification of learners' cognitive states and the quality of web learning services. To address these problems, we propose an identifiable cognitive diagnosis framework (ID-CDF) based on a novelresponse-proficiency-response paradigm inspired by encoder-decoder models. Specifically, we first devise the diagnostic module of ID-CDF, which leverages inductive learning to eliminate randomness in optimization to guarantee identifiability and captures the monotonicity between overall response data distribution and cognitive states to prevent explainability overfitting. Next, we propose a flexible predictive module for ID-CDF to ensure diagnosis preciseness. We further present an implementation of ID-CDF, i.e., ID-CDM, to illustrate its usability. Extensive experiments on four real-world datasets with different characteristics demonstrate that ID-CDF can effectively address the problems without loss of diagnosis preciseness. Our code is available at https://***/CSLiJT/ID-CDF. © 2024 ACM.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Legal Judgment Prediction with Multiple Perspectives on Civil Cases 1st

Legal Judgment Prediction with Multiple Perspectives on Civi...

引用

1st CAAI International Conference on Artificial Intelligence, CICAI 2021

作者： Zhao, Lili Yue, Linan An, Yanqing Liu, Ye Zhang, Kai He, Weidong Chen, Yanmin Yuan, Senchao Liu, Qi Anhui Province Key Laboratory of Big Data Analysis and Application School of Data Science and School of Computer Science and Technology University of Science and Technology of China Hefei China

ISBN: (纸本)9783030930455

Legal Judgment Prediction, which aims at predicting the judgment result based on case materials, is an essential task in Legal Intelligence. Most existing studies have analyzed and modeled criminal cases as a whole, while a small part of the research focuses on civil cases which are also significant in the legal system. In these studies, most model on a certain type of civil causes and make the judgment prediction based on the ascertained fact from the perspective of the court. However, in real-world scenarios, there are different civil cases on various causes, and every case is judged from multiple perspectives (i.e., plaintiff, defendant, and the court). It is difficult to make judgment predictions on various civil causes. To address the above challenges, in this paper, we propose a novel Civil Case Judgment (CCJudge) prediction method by simulating the logic of judges. Following this logic, we construct an external knowledge base that contains the explanations and applications of every cause, it helps make the judgment on various causes. Furthermore, a special encoder layer and interaction layer are designed for learning linguistic semantics from multiple perspectives. We conduct extensive experiments on a real-world dataset. The experimental results demonstrate the effectiveness of our method. © 2021, Springer Nature Switzerland AG.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

CoCGAN: Contrastive Learning for Adversarial Category Text Generation 29

CoCGAN: Contrastive Learning for Adversarial Category Text G...

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Sheng, Xin Xu, Linli Xu, Yinlong Bao, Changcun Chen, Huang Ren, Bo Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China China School of Computer Science and Technology University of Science and Technology of China China State Key Laboratory of Cognitive Intelligence China Tencent Youtu Lab China

The task of generating texts of different categories has attracted more and more attention in the area of natural language generation recently. Meanwhile, generative adversarial net (GAN) has demonstrated its effectiveness on text generation, and is further applied to category text generation in later works. Different from existing methods, which mainly consider the pairwise relations between the text embedding and the corresponding fixed one-hot class label (data-to-class relations), this paper proposes a novel Contrastive Category Generative Adversarial Net (CoCGAN) to incorporate contrastive learning into adversarial category text generation, considering more flexible data-to-class relations as well as relations between the multiple text embeddings in the same batch (data-to-data relations). The discriminator of CoCGAN discriminates the authenticity of given samples and optimizes a contrastive learning objective to capture both more flexible data-to-class relations and data-to-data relations among training samples. Accordingly, the generator tries to produce more realistic samples which can confuse the discriminator. Experimental results on both synthetic and real category text generation datasets demonstrate that CoCGAN can achieve significant improvements over the baseline category text generation models. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Communication-Efficient Distributed Learning with Local Immediate Error Compensation

arXiv

引用

arXiv 2024年

作者： Cheng, Yifei Shen, Li Xu, Linli Qian, Xun Wu, Shiwei Zhou, Yiming Zhang, Tie Tao, Dacheng Chen, Enhong The Anhui Province Key Lab of Big Data Analysis and Application State Key Laboratory of Cognitive Intelligence School of Data Science School of Computer Science University of Science and Technology China The JD Explore Academy China The Shanghai Artificial Intelligence Laboratory China

Gradient compression with error compensation has attracted significant attention with the target of reducing the heavy communication overhead in distributed learning. However, existing compression methods either perform only unidirectional compression in one iteration with higher communication cost, or bidirectional compression with slower convergence rate. In this work, we propose the Local Immediate Error Compensated SGD (LIEC-SGD) optimization algorithm to break the above bottlenecks based on bidirectional compression and carefully designed compensation approaches. Specifically, the bidirectional compression technique is to reduce the communication cost, and the compensation technique compensates the local compression error to the model update immediately while only maintaining the global error variable on the server throughout the iterations to boost its efficacy. Theoretically, we prove that LIEC-SGD is superior to previous works in either the convergence rate or the communication cost, which indicates that LIEC-SGD could inherit the dual advantages from unidirectional compression and bidirectional compression. Finally, experiments of training deep neural networks validate the effectiveness of the proposed LIEC-SGD algorithm. Copyright © 2024, The Authors. All rights reserved.

关键词： Error compensation

来源：评论

学校读者我要写书评

暂无评论

HyperCalm Sketch: One-Pass Mining Periodic Batches in data Streams

HyperCalm Sketch: One-Pass Mining Periodic Batches in Data S...

引用

International Conference on data Engineering

作者： Zirui Liu Chaozhe Kong Kaicheng Yang Tong Yang Ruijie Miao Qizhi Chen Yikai Zhao Yaofeng Tu Bin Cui School of Computer Science and National Engineering Laboratory for Big Data Analysis Technology and Application Peking University Beijing China Peng Cheng Laboratory Shenzhen China ZTE Corporation

Batch is an important pattern in data streams, which refers to a group of identical items that arrive closely. We find that some special batches that arrive periodically are of great value. In this paper, we formally define a new pattern, namely periodic batches. A group of periodic batches refers to several batches of the same item, where these batches arrive periodically. Studying periodic batches is important in many applications, such as caches, financial markets, online advertisements, networks, etc. We propose a one-pass sketching algorithm, namely the HyperCalm sketch, which takes two phases to detect periodic batches in real time. In phase 1, we propose a time-aware Bloom filter, namely HyperBloomFilter (HyperBF), to detect the start of batches. In phase 2, we propose an enhanced top-k algorithm, called Calm Space-Saving (CalmSS), to report top-k periodic batches. We theoretically derive the error bounds for HyperBF and CalmSS. Extensive experiments show HyperCalm outperforms the strawman solutions 4× in term of average relative error and 13.2× in term of speed. We also apply HyperCalm to a cache system and integrate HyperCalm into Apache Flink. All related codes are open-sourced.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Lightweight Transformer Network and Self-supervised Task for Kinship Verification 8

Lightweight Transformer Network and Self-supervised Task for...

引用

8th IEEE International Conference on computer and Communications, ICCC 2022

作者： Zhu, Xiaoke Li, Yunwei Li, Danyang Dong, Lingyun Chen, Xiaopan School of Computer and Information Engineering Henan University Kaifeng China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China Henan Engineering Research Center of Intelligent Technology and Application Henan University China

ISBN: (纸本)9781665450515

Kinship verification is one of the interesting and critical problems in computer vision research, with significant progress in the past decades. Meanwhile, Vision Transformer (VIT) has recently achieved impressive success in many domains, including object detection, image recognition, and semantic segmentation, among others. Most of the previous work on kinship verification are based on convolutional or recurrent neural networks. Compared with the local processing of images like convolutions, transformers can effectively understand and process images globally. However, due to overuse, there are many Transformer layers of fully connected layers, and VIT speed is still an issue. Therefore, in this paper, inspired by the recent success of Transformer models in vision tasks, we propose a Transformer-based kinship verification for training and optimizing kinship verification models. We first train the basic vision transformer (VIT-B) with 12 transformer layers, then we reduce the transformer layers to 6 layers, namely VIT-S (Small Vit) and 4 layers, namely VIT-T (Tiny Vit), to make a tradeoff between optimization accuracy and efficiency. As the first attempt to apply Transformer to the kinship verification task, it provides a feasible strategy for kinship research topics and verifies the effectiveness of the method in terms of the accuracy of the experimental results. © 2022 IEEE.

关键词： Image recognition

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised Segmentation and Quantization Algorithm for Infarct Size Measurement of Rat Heart Sections 8

Semi-supervised Segmentation and Quantization Algorithm for ...

引用

8th IEEE International Conference on computer and Communications, ICCC 2022

作者： Zhu, Xiaoke Cai, Yulong Chen, Xiaopan Hu, Qi Dong, Lingyun Yuan, Caihong School of Computer and Information Engineering Henan University Kaifeng China Henan University Henan Key Laboratory of Big Data Analysis and Processing Kaifeng China Henan Engineering Research Center of Intelligent Technology and Application Henan University China

ISBN: (纸本)9781665450515

Segmentation of rat heart section images and infarct area quantization are essential components of infarct size measurement in processing data from animal experiments on ischemic heart disease. Previously, the task of measuring the infarct size of rat heart sections was performed manually by experienced researchers, which was very costly and time-consuming. In this paper, we propose a two-stage semi-supervised approach to solve the task of ischemic heart infarct size calculation in images of rat section images. The approach uses a semi-supervised semantic segmentation model and a semi-automated quantization algorithm to separate the differently stained regions of rat heart sections. We demonstrate the results of the approach on a rat heart section dataset, and experiments on this dataset emphasize the effectiveness of our approach compared to other methods. © 2022 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Point-Level and Set-Level Deep Representation Learning for Cross-Modal Person Re-identification 8

Point-Level and Set-Level Deep Representation Learning for C...

引用

8th IEEE International Conference on computer and Communications, ICCC 2022

作者： Hu, Jihui Ye, Pengfei Li, Danyang Dong, Lingyun Chen, Xiaopan Zhu, Xiaoke School of Computer and Information Engineering Henan University Kaifeng China Henan University Henan Key Laboratory of Big Data Analysis and Processing Kaifeng China Henan University Henan Engineering Research Center of Intelligent Technology and Application China

ISBN: (纸本)9781665450515

In practice, significant modality differences usually exist between visible and infrared images, which makes visible-infrared Person Re-Identification (VI-ReID) a challenging research task. Due to the existing influence of pose variation, background changes, and occlusion, there are often outlier samples within the set of images from the same person. These outlier samples can adversely affect the process of learning the cross-modal matching model. The existing VI-ReID methods mainly focus on learning cross-modal feature representation by using image-level discriminant constraints, i.e., the distance between the truly-matching cross-modal images should be smaller than that between wrong-matching cross-modal images. However, most of these methods ignore the adverse influence caused by outliers. To solve the above problems, we proposed a Point-level and Set-level Deep Representation Learning (PSDRL) approach for VI-ReID in this paper. By using the set-level constraint in the process of deep representation learning, the discrepancy between visible and infrared modalities can be decreased, and the adverse effect of outliers can be weakened. By employing the image-level constraint, the discriminability of the obtained deep feature representations can be improved. Extensive experiments are conducted on the publicly available cross-modal Person Re-Identification datasets, including SYSU-MM01 and RegDB. Experimental results demonstrate the effectiveness of the proposed approach. © 2022 IEEE.

关键词： Infrared imaging

来源：评论

学校读者我要写书评

暂无评论

Inverse Markov Process Based Constrained Dynamic Graph Layout

引用

Journal of computer Science & Technology 2021年第3期36卷 707-718页

作者： Shi-Ying Sheng Sheng-Tao Chen Xiao-Ju Dong Chun-Yuan Wu Xiao-Ru Yuan ParisTech Elite Institute of Technology Shanghai Jiao Tong UniversityShanghai 200240China Department of Computer Science and Engineering Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of Machine Perception(Ministry of Education) National Engineering Laboratory for Big Data Analysis and ApplicationPeking UniversityBeijing 100080China

In online dynamic graph drawing,constraints over nodes and node pairs help preserve a coherent mental map in a sequence of *** the constraints is challenging due to the requirements of both preserving mental map and satisfying the visual aesthetics of a graph *** existing algorithms basically depend on local changes but fail to do proper evaluations on the global propagation when setting *** solve this problem,we introduce a heuristic model derived from PageRank which simulates the node movement as an inverse Markov process hence to give a global analysis of the layout's change,according to which different constraints can be *** constraints,along with stress function,generate layouts maintaining spatial positions and shapes of relatively stable substructures between adjacent *** demonstrate that our method preserves both structure and position similarity to help users track graph changes visually.

关键词： graph drawing data stream dynamic graph layout

来源：评论

学校读者我要写书评

暂无评论

PISketch: Finding Persistent and Infrequent Flows 3

PISketch: Finding Persistent and Infrequent Flows

引用

3rd ACM SIGCOMM 2022 Workshop on Formal Foundations and Security of Programmable Network Infrastructures, FFSPIN 2022

作者： Fan, Zhuochen Hu, Zhoujing Wu, Yuhan Guo, Jiarui Liu, Wenrui Yang, Tong Wang, Hengrui Xu, Yifei Uhlig, Steve Tu, Yaofeng School of Computer Science National Engineering Laboratory for Big Data Analysis Technology and Application Peking University China Computer Science Department University of California Los Angeles United States School of Electronic Engineering and Computer Science Queen Mary University of London United Kingdom ZTE Corporation China

ISBN: (纸本)9781450393294

Finding persistent and inactive activity periods is very helpful in practice, for example to detect intrusion activities. Most of the literature focuses on finding persistent flows or frequent flows. No previous work is able to find persistent and infrequent flows. In this paper, we propose a novel sketch data structure, PISketch, to find persistent and infrequent flows in real time. The key idea of PISketch is to define a weight and its Reward and Penalty System for each flow to combine and balance the information of both persistency and infrequency, and to keep high-weighted flows in a limited space through a strategy. We implement PISketch on P4 and CPU platforms, and compare the performance of PISketch with two strawman solutions (On-Off + CM sketch, and PIE + CM sketch), in terms of finding persistent and infrequent flows. Our experimental results demonstrate the advantage of PISketch, by comparing it to two strawman solutions: 1) The F1 Score of PISketch is around 22.1% and 57.6% higher than two strawman solutions, respectively;2) The Average Relative Error (ARE) of PISketch is around 820.9 (up to 1188.8) and 126.2 (up to 265.6) times lower than two strawman solutions, respectively;3) The insertion throughput of PISketch is around 1.23 and 16.5 times higher than two strawman solutions, respectively. Moreover, we implement two concrete cases of PISketch through end-to-end experiments. All of our codes are available at GitHub. © 2022 ACM.

关键词： infrequent items persistent items sketch weight fusion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：