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

arXiv 2021年

作者： Bi, Haoyang Ma, Haiping Huang, Zhenya Yin, Yu Liu, Qi Chen, Enhong Su, Yu Wang, Shijin Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China China Anhui University China IFLYTEK Research

Computerized Adaptive Testing (CAT) is emerging as a promising testing application in many scenarios, such as education, game and recruitment, which targets at diagnosing the knowledge mastery levels of examinees on required concepts. It shows the advantage of tailoring a personalized testing procedure for each examinee, which selects questions step by step, depending on her performance. While there are many efforts on developing CAT systems, existing solutions generally follow an inflexible model-specific fashion. That is, they need to observe a specific cognitive model which can estimate examinee’s knowledge levels and design the selection strategy according to the model estimation. In this paper, we study a novel model-agnostic CAT problem, where we aim to propose a flexible framework that can adapt to different cognitive models. Meanwhile, this work also figures out CAT solution with addressing the problem of how to generate both high-quality and diverse questions simultaneously, which can give a comprehensive knowledge diagnosis for each examinee. Inspired by Active Learning, we propose a novel framework, namely Model-Agnostic Adaptive Testing (MAAT) for CAT solution, where we design three sophisticated modules including Quality Module, Diversity Module and Importance Module. Specifically, at one CAT selection step, Quality Module first quantifies the informativeness of questions and generates candidate subset with the highest quality. Then, Diversity Module selects one question at each step that maximizes the concept coverage. Additionally, we propose Importance Module to estimate the importance of concepts that optimizes the CAT selection. Under MAAT, we prove that the goal of maximizing both quality and diversity is NP-hard, but we provide efficient algorithms by exploiting the inherent submodular property. Extensive experimental results on two real-world datasets clearly demonstrate that our MAAT can support CAT with guaranteeing both quality and diversity

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

A Cognitive Solver with Autonomously Knowledge Learning for Reasoning Mathematical Answers

A Cognitive Solver with Autonomously Knowledge Learning for ...

引用

IEEE International Conference on data Mining (ICDM)

作者： Jiayu Liu Zhenya Huang Xin Lin Qi Liu Jianhui Ma Enhong Chen Anhui Province Key Laboratory of Big Data Analysis and Application School of Data Science & School of Computer Science and Technology University of Science and Technology of China State Key Laboratory of Cognitive Intelligence

Reasoning answers to mathematical problems requires machines to think and operate like a human to learn knowledge from mathematical data, which is one of the fundamental tasks for exploring general artificial intelligence. Most solutions focus on mimicking how humans understand problems, which generate the necessary expressions for answers. However, they are still far from enough since they ignore the core ability of humans to acquire knowledge from experience. In this paper, we propose a Cognitive Solver (CogSolver) that is capable of autonomously learning knowledge from scratch to solve mathematical problems, inspired by two cognitive science theories. Specifically, we draw one insight from the dual process theory to establish an intelligent BRAIN-ARM framework, and refer to another information processing theory to summarize the knowledge learning process into Store-Apply-Update steps. In CogSolver, the BRAIN system stores three types of mathematical knowledge, including semantics knowledge, relation knowledge, and mathematic rule knowledge. Then, the ARM system applies the knowledge in BRAIN to answer the problems. Specifically, we design a knowledge-aware module and a commutative module in ARM to improve its reasoning ability, where the knowledge is organically integrated into answer reasoning process. After solving the problems, BRAIN updates the stored knowledge according to the feedback of ARM, where we develop knowledge filters to eliminate the redundant ones and further form a more reasonable knowledge base. Our CogSolver carries out the above three steps iteratively, which behaves more like a human. We conduct extensive experiments on real-world math word problem datasets. The experimental results demonstrate the improvement in answer reasoning and clearly show how CogSolver gains knowledge from the problems, leading to superior interpretability. Our codes are available at https://***/bigdata-ustc/CogSolver.

关键词： Commutation Semantics Knowledge based systems Information processing Cognition Mathematics Filtering theory

来源：评论

学校读者我要写书评

暂无评论

Bit-mask Robust Contrastive Knowledge Distillation for Unsupervised Semantic Hashing 24

Bit-mask Robust Contrastive Knowledge Distillation for Unsup...

引用

33rd ACM Web Conference, WWW 2024

作者： He, Liyang Huang, Zhenya Liu, Jiayu Chen, Enhong Wang, Fei Sha, Jing Wang, Shijin School of Computer Science and Technology University of Science and Technology of China State Key Laboratory of Cognitive Intelligence Hefei China School of Data Science University of Science and Technology of China State Key Laboratory of Cognitive Intelligence Hefei China Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of China State Key Laboratory of Cognitive Intelligence Hefei China State Key Laboratory of Cognitive Intelligence Hefei China

ISBN: (纸本)9798400701719

Unsupervised semantic hashing has emerged as an indispensable technique for fast image search, which aims to convert images into binary hash codes without relying on labels. Recent advancements in the field demonstrate that employing large-scale backbones (e.g., ViT) in unsupervised semantic hashing models can yield substantial improvements. However, the inference delay has become increasingly difficult to overlook. Knowledge distillation provides a means for practical model compression to alleviate this delay. Nevertheless, the prevailing knowledge distillation approaches are not explicitly designed for semantic hashing. They ignore the unique search paradigm of semantic hashing, the inherent necessities of the distillation process, and the property of hash codes. In this paper, we propose an innovative Bit-mask Robust Contrastive knowledge Distillation (BRCD) method, specifically devised for the distillation of semantic hashing models. To ensure the effectiveness of two kinds of search paradigms in the context of semantic hashing, BRCD first aligns the semantic spaces between the teacher and student models through a contrastive knowledge distillation objective. Additionally, to eliminate noisy augmentations and ensure robust optimization, a cluster-based method within the knowledge distillation process is introduced. Furthermore, through a bit-level analysis, we uncover the presence of redundancy bits resulting from the bit independence property. To mitigate these effects, we introduce a bit mask mechanism in our knowledge distillation objective. Finally, extensive experiments not only showcase the noteworthy performance of our BRCD method in comparison to other knowledge distillation methods but also substantiate the generality of our methods across diverse semantic hashing models and backbones. The code for BRCD is available at https://***/hly1998/BRCD. © 2024 Owner/Author.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Measuring the popularity of job skills in recruitment market: A multi-criteria approach

arXiv

引用

arXiv 2017年

作者： Xu, Tong Zhu, Hengshu Zhu, Chen Li, Pan Xiong, Hui Anhui Province Key Lab of Big Data Analysis and Application University of Science and Technology of China Baidu Talent Intelligence Center Baidu Inc Rutgers Business School Rutgers University

To cope with the accelerating pace of technological changes, talents are urged to add and refresh their skills for staying in active and gainful employment. This raises a natural question: what are the right skills to learn? Indeed, it is a nontrivial task to measure the popularity of job skills due to the diversified criteria of jobs and the complicated connections within job skills. To that end, in this paper, we propose a data driven approach for modeling the popularity of job skills based on the analysis of large-scale recruitment data. Specifically, we first build a job skill network by exploring a large corpus of job postings. Then, we develop a novel Skill Popularity based Topic Model (SPTM) for modeling the generation of the skill network. In particular, SPTM can integrate different criteria of jobs (e.g., salary levels, company size) as well as the latent connections within skills, thus we can effectively rank the job skills based on their multi-faceted popularity. Extensive experiments on real-world recruitment data validate the effectiveness of SPTM for measuring the popularity of job skills, and also reveal some interesting rules, such as the popular job skills which lead to high-paid *** Codes 68T30 Copyright © 2017, The Authors. All rights reserved.

关键词： Compensation (personnel)

来源：评论

学校读者我要写书评

暂无评论

Faster distributed deep net training: Computation and communication decoupled stochastic gradient descent

arXiv

引用

arXiv 2019年

作者： Shen, Shuheng Xu, Linli Liu, Jingchang Liang, Xianfeng Cheng, Yifei Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China School of Data Science University of Science and Technology of China

With the increase in the amount of data and the expansion of model scale, distributed parallel training becomes an important and successful technique to address the optimization challenges. Nevertheless, although distributed stochastic gradient descent (SGD) algorithms can achieve a linear iteration speedup, they are limited significantly in practice by the communication cost, making it difficult to achieve a linear time speedup. In this paper, we propose a computation and communication decoupled stochastic gradient descent (CoCoDSGD) algorithm to run computation and communication in parallel to reduce the communication cost. We prove that CoCoD-SGD has a linear iteration speedup with respect to the total computation capability of the hardware resources. In addition, it has a lower communication complexity and better time speedup comparing with traditional distributed SGD algorithms. Experiments on deep neural network training demonstrate the significant improvements of CoCoD-SGD: when training ResNet18 and VGG16 with 16 Geforce GTX 1080Ti GPUs, CoCoD-SGD is up to 2-3x faster than traditional synchronous SGD. Copyright © 2019, The Authors. All rights reserved.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Explainable fashion recommendation: A semantic attribute region guided approach

arXiv

引用

arXiv 2019年

作者： Hou, Min Wu, Le Chen, Enhong Li, Zhi Zheng, Vincent W. Liu, Qi Anhui Province Key Lab. of Big Data Analysis and Application University of S&T of China School of Data Science University of S&T of China Hefei University of Technology WeBank

In fashion recommender systems, each product usually consists of multiple semantic attributes (e.g., sleeves, collar, etc). When making cloth decisions, people usually show preferences for different semantic attributes (e.g., the clothes with v-neck collar). Nevertheless, most previous fashion recommendation models comprehend the clothing images with a global content representation and lack detailed understanding of users' semantic preferences, which usually leads to inferior recommendation performance. To bridge this gap, we propose a novel Semantic Attribute Explainable Recommender System (SAERS). Specifically, we first introduce a fine-grained interpretable semantic space. We then develop a Semantic Extraction Network (SEN) and Fine-grained Preferences Attention (FPA) module to project users and items into this space, respectively. With SAERS, we are capable of not only providing cloth recommendations for users, but also explaining the reason why we recommend the cloth through intuitive visual attribute semantic highlights in a personalized manner. Extensive experiments conducted on realworld datasets clearly demonstrate the effectiveness of our approach compared with the state-ofthe-art methods. Copyright © 2019, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

STGCN: A Spatial-Temporal Aware Graph Learning Method for POI Recommendation

STGCN: A Spatial-Temporal Aware Graph Learning Method for PO...

引用

IEEE International Conference on data Mining (ICDM)

作者： Haoyu Han Mengdi Zhang Min Hou Fuzheng Zhang Zhongyuan Wang Enhong Chen Hongwei Wang Jianhui Ma Qi Liu Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China Meituan-Dianping Group Stanford University

ISBN: (数字)9781728183169

ISBN: (纸本)9781728183176

Point-of-Interest (POI) recommendation helps users find their interested places to visit based on the time and user location. Unlike traditional recommendation tasks, POI recommendation is personalized, spatial-aware, and temporally dependent. Although many previous works have tried modeling spatial and temporal characteristics, most of them suffer from the following two limitations: For the spatial aspect, existing works only consider the user-POI distance or POI-POI distance. However, we find that a user prefers different regions at different times, which is known as user-region periodic pattern. For the temporal aspect, most works treat user and time as two independent factors. However, different users may prefer the same POI in different time periods, which is known as user-POI periodic pattern. To address the limitation of existing works, we propose a novel Spatial-Temporal aware Graph Convolutional Neural Network (STGCN) for POI recommendation. Specifically, we first design a user record multigraph to fuse all the context information into a unified graph. Then, we propose a time-based neighborhood sampling algorithm and take advantage of the flexible propagation mechanism of GCNs to learn the representations of each node at a specific time. Furthermore, multiple scoring functions are proposed to exploit user-region periodic pattern and user-POI periodic pattern, respectively. We also develop a time smoothing strategy to alleviate the data sparsity problem. Extensive experiments are conducted on two real-world datasets, and the experimental results demonstrate the effectiveness of our method.

关键词： Learning systems Heating systems Smoothing methods Image color analysis Fuses data mining Task analysis

来源：评论

学校读者我要写书评

暂无评论

ICSTrace: A Malicious IP Traceback Model for Attacking data of Industrial Control System

arXiv

引用

arXiv 2019年

作者： Xiao, Feng Xu, Qiang Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China Electronic Engineering Institute of Hefei China

Considering the attacks against industrial control system are mostly organized and premeditated actions, IP traceback is significant for the security of industrial control system. Based on the infrastructure of the Internet, we have developed a novel malicious IP traceback model-ICSTrace, without deploying any new services. The model extracts the function codes and their parameters from the attack data according to the format of industrial control protocol, and employs a short sequence probability method to transform the function codes and their parameter into a vector, which characterizes the attack pattern of malicious IP addresses. Furthermore, a Partial Seeded K-Means algorithm is proposed for the pattern’s clustering, which helps in tracing the attacks back to an organization. ICSTrace is evaluated basing on the attack data captured by the large-scale deployed honeypots for industrial control system, and the results demonstrate that ICSTrace is effective on malicious IP traceback in industrial control system. Copyright © 2019, The Authors. All rights reserved.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Exploiting Knowledge Hierarchy for Finding Similar Exercises in Online Education Systems

Exploiting Knowledge Hierarchy for Finding Similar Exercises...

引用

IEEE International Conference on data Mining (ICDM)

作者： Wei Tong Shiwei Tong Wei Hunag Liyang He Jianhui Ma Qi Liu Enhong Chen School of Computer Science and Technology Anhui Province Key Laboratory of Big Data Analysis and Application & School of Data Science University of Science and Technology of China University of Science and Technology of China China

ISBN: (数字)9781728183169

ISBN: (纸本)9781728183176

In education systems, Finding Similar Exercises (FSE) is the key step for both exercise retrieval and duplicate detection. Recently, more and more attention has been drawn into this area and several works have been proposed, to utilize the exercise content (e.g., texts or images) or the labeled knowledge concepts. Such approaches, however, have failed to take knowledge hierarchy into account. To this end, we advance a novel knowledge-aware multimodal network, namely KnowNet, for finding similar exercises in large-scale online education systems by integrating the knowledge hierarchy into the heterogeneous exercise data and learning a relation-aware semantic representation. Specifically, we first propose a Content Representation Layer (CRL) to learn a unified semantic representation of the heterogeneous exercise content. Then, we design a Hierarchy Fusion Layer (HFL) to exploit the knowledge hierarchy. By combining the knowledge hierarchy, HFL can not only retrieve the relation-aware semantic representation but also provide an interpretable view to investigate the similarity of exercises. Finally, we adopt a Similarity Score Layer (SSL) for returning similar exercises. Extensive experiments demonstrate the effectiveness and interpretability of KnowNet.

关键词： Knowledge engineering Conferences Semantics Education data mining

来源：评论

学校读者我要写书评

暂无评论

SIFN: A sentiment-aware interactive fusion network for review-based item recommendation

arXiv

引用

arXiv 2021年

作者： Zhang, Kai Qian, Hao Liu, Qi Zhang, Zhiqiang Zhou, Jun Ma, Jianhui Chen, Enhong Anhui Province Key Lab of Big Data Analysis and Application School of Data Science University of Science and Technology of China Ant Group Hangzhou China School of Computer Science and Technology University of Science and Technology of China

Recent studies in recommender systems have managed to achieve significantly improved performance by leveraging reviews for rating prediction. However, despite being extensively studied, these methods still suffer from some limitations. First, previous studies either encode the document or extract latent sentiment via neural networks, which are difficult to interpret the sentiment of reviewers intuitively. Second, they neglect the personalized interaction of reviews with user/item, i.e., each review has different contributions when modeling the sentiment preference of user/item. To remedy these issues, we propose a Sentiment-aware Interactive Fusion Network (SIFN) for review-based item recommendation. Specifically, we first encode user/item reviews via BERT and propose a light-weighted sentiment learner to extract semantic features of each review. Then, we propose a sentiment prediction task that guides the sentiment learner to extract sentiment-aware features via explicit sentiment labels. Finally, we design a rating prediction task that contains a rating learner with an interactive and fusion module to fuse the identity (i.e., user and item ID) and each review representation so that various interactive features can synergistically influence the final rating score. Experimental results on five real-world datasets demonstrate that the proposed model is superior to state-of-the-art models. © 2021, CC BY.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：