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

IEEE International Conference on data Mining (ICDM)

作者： Bo Wang Zhao Zhang Jicong Fan Mingbo Zhao Choujun Zhan Mingliang Xu 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 School of Data Science The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Shenzhen China School of Information Science and Technology Donghua University Shanghai China School of Electrical and Computer Engineering Nanfang College Guangzhou Guangzhou China School of Information Engineering Zhengzhou University Zhengzhou China

Image captioning is still a challenging task aiming at describing the contents of image by words. Current image caption methods usually assume the object relation to be important if the semantic and spatial geometric relationships between objects are close and large, but the relations meeting this assumption are not necessarily important to describe the contents of image in a fine-grained way. That is, the importance of fine-grained object relations is not properly taken into account. Besides, current Transformer based image caption models also fail to consider the importance of fine-grained objects, since they generate all the words of a sentence at one time, which cannot Figure out which objects are more important and vice versa. In this paper, we propose a novel Fine-grained Adaptive Object Transformer (FineFormer) network, which can jointly discover the importance of fine-grained objects and object relations for image captioning. Specifically, a new concept of adaptive soft-foreground attention is proposed to highlight the fine-grained objects dominating the descriptive contents. To characterize and calculate the important relations between fine-grained objects, we also propose an adaptive object relation attention to refine the object relation from the generation process of relation. As such, FineFormer can describe the contents of image more accurately, by reducing the interference of unimportant objects in the background. Extensive experiments on the highly-competitive MS-COCO dataset demonstrated the superiority of our FineFormer.

关键词： Adaptation models Adaptive systems Current transformers Semantics Interference data mining Task analysis

来源：评论

学校读者我要写书评

暂无评论

Dynamic Tracking with Fuzzy Rules for Evolutionary Dynamic Constrained Optimization

Dynamic Tracking with Fuzzy Rules for Evolutionary Dynamic C...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Chenyang Bu Yuxin Liu Lizhong Zhang Tao Zhu Wenjian Luo Ministry of Education Key Laboratory of Knowledge Engineering with Big Data School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China School of Computer Science and Information Engineering University of South China Hengyang Hunan China School of Computer Science and Technology Harbin Institute of Technology Shenzhen Guangdong China

Nature-inspired population-based stochastic search algorithms (SSA) have demonstrated effectiveness in solving many real-world dynamic optimization problems (DOPs), such as dynamic optimal power flow (DOPF) problems. The basic idea of solving DOPs using SSAs is to “track the moving optima”, rather than solving the changed problems from scratch. Its hidden assumption is that the problems are slightly changed in general, and it is expected that the search process can be accelerated by learning from past search experiences. However, the hidden assumption that the current search process can always benefit from previous search experiences might not be true for certain cases. For example, if the current problem is not similar to any of its previous problems, the historical solutions might not be helpful for the current search. To reduce such negative transfer, the following issues are worthy of study: how to choose which historical problems to learn from, and how to determine the degree of learning from historical problems. To solve the above problems, we propose a dynamic processing framework based on fuzzy rules from the perspective of incorporating human knowledge for optima tracking. The experimental results on the DOPF problems show that the SSA with the proposed optima tracking strategy outperforms other comparative algorithms. We open up the code and data of our algorithm 4 4 https://***/DMiC-Lab-HFUT/SMDE-Transfer.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Communication with children for older adults' life satisfaction: Non-face-to-face and/or face-to-face?

引用

Gerontechnology 2016年第4期14卷 191-203页

作者： Sun, Kai Zuo, Meiyun Kong, Dong Key Laboratory of Data Engineering and Knowledge Engineering School of Business Renmin University of China Beijing China Research Institute of Smart Aged Care School of Information National Academy of Development and Strategy Renmin University of China Beijing China

Objectives Communication with children is an important way to reduce the effect of empty nest syndrome and increase life satisfaction of older adults. Under new network environment, more and more young people rely on non-face-to-face (nFTF) technology to communicate with parents, instead of face-to-face (FTF) communication due to the constraints of living condition and busy schedule of job. We are wondering whether it is good for older adults' life satisfaction. Specifically, can nFTF provide the same benefit as FTF does to increase older adults' life satisfaction? How to use nFTF to benefit older adults best? Theories From the perspective of family support (for instance, emotional support and instrumental support), this paper mainly uses Media-Richness Theory and Social Presence Theory to analyse the different capability of FTF and nFTF to increase older adults' life satisfaction. Besides, we try to examine in which situation increasing nFTF can benefit older adults. Design The data of China Health and Retirement Longitudinal Study (CHARLS) is used to test our hypotheses. Results FTF is better than nFTF to increase life satisfaction. Only in the context that FTF is harder or less available (frequency of FTF is less than once every six months), nFTF is positively related to increasing life satisfaction;when the frequency of FTF is more than once every six months, more nFTF will not provide an extra benefit for older adults. In the present paper, we systematically analyse the difference of FTF and nFTF, and extend previous studies, which focus on nFTF's advantage, to in what context nFTF can cooperate with FTF to increase older adults' life satisfaction.

关键词： Face-to-face Life satisfaction Non-face-to-face Older adults

来源：评论

学校读者我要写书评

暂无评论

Weighted partial order oriented three-way decisions under score-based common voting rules

引用

International Journal of Approximate Reasoning 2020年 123卷 41-54页

作者： Li, Lei Wu, Xindong Chen, Huanhuan Zhou, Chuan Liu, Guanfeng Jiang, Yongkang Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei 230601 China Mininglamp Academy of Sciences Mininglamp Technologies Beijing 100084 China School of Computer Science and Technology University of Science and Technology of China Hefei 230026 China Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100190 China Computing Dept Macquarie University Sydney A1C 5S7 Australia

Recently, with the trisecting and acting models of human cognitive behaviors, three-way decisions are introduced to deal with uncertain decisions in many applications. To define and conduct the three-way decisions on the possible or necessary loser or co-loser and/or winner or co-winner, we first define the score-based common voting rules, where a score-based function is introduced to evaluate certain utility, including positional scoring rules, maximin, Bucklin, and so on. Then on one hand, it has been proved that under certain conditions three-way decisions on the possible loser or co-loser and/or winner or co-winner are NP-complete with positional scoring rules, maximin, and Bucklin, respectively. On the other hand, we have presented algorithms whose time complexity is polynomial to conduct three-way decisions on the necessary winner or co-winner and/or necessary loser or co-loser with positional scoring rules, maximin, and Bucklin in time O(nm²), O(nm³), and O(nm²), respectively, which has been validated experimentally. © 2020 Elsevier Inc.

关键词： Common voting rules Three-way decisions Weighted partial orders

来源：评论

学校读者我要写书评

暂无评论

Multi-frame joint enhancement for early interlaced videos

arXiv

引用

arXiv 2021年

作者： Zhao, Yang Ma, Yanbo Chen, Yuan Jia, Wei Wang, Ronggang Liu, Xiaoping The Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei230009 China The School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China The School of Electronic and Computer Engineering Peking University Shenzhen Graduate School 2199 Lishui Road Shenzhen518055 China Peng Cheng Laboratory Shenzhen518000 China

Early interlaced videos usually contain multiple and interlacing and complex compression artifacts, which significantly reduce the visual quality. Although the high-definition reconstruction technology for early videos has made great progress in recent years, related research on deinterlacing is still lacking. Traditional methods mainly focus on simple interlacing mechanism, and cannot deal with the complex artifacts in real-world early videos. Recent interlaced video reconstruction deep deinterlacing models only focus on single frame, while neglecting important temporal information. Therefore, this paper proposes a multiframe deinterlacing network joint enhancement network for early interlaced videos that consists of three modules, i.e., spatial vertical interpolation module, temporal alignment and fusion module, and final refinement module. The proposed method can effectively remove the complex artifacts in early videos by using temporal redundancy of multi-fields. Experimental results demonstrate that the proposed method can recover high quality results for both synthetic dataset and real-world early interlaced videos. Copyright © 2021, The Authors. All rights reserved.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Trustworthy preference completion in social choice

arXiv

引用

arXiv 2020年

作者： Li, Lei Xue, Minghe H., Chen X., Wu The School of Computer Science and Technology University of Science and Technology of China China Mininglamp Academy of Sciences Mininglamp Technologies Beijing China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei China

As from time to time it is impractical to ask agents to provide linear orders over all alternatives, for these partial rankings it is necessary to conduct preference completion. Specifically, the personalized preference of each agent over all the alternatives can be estimated with partial rankings from neighboring agents over subsets of alternatives. However, since the agents’ rankings are nondeterministic, where they may provide rankings with noise, it is necessary and important to conduct the trustworthy preference completion. Hence, in this paper firstly, a trust-based anchor-kNN algorithm is proposed to find k-nearest trustworthy neighbors of the agent with trust-oriented Kendall-Tau distances, which will handle the cases when an agent exhibits irrational behaviors or provides only noisy rankings. Then, for alternative pairs, a bijection can be built from the ranking space to the preference space, and its certainty and conflict can be evaluated based on a well-built statistical measurement Probability-Certainty Density Function. Therefore, a certain common voting rule for the first k trustworthy neighboring agents based on certainty and conflict can be taken to conduct the trustworthy preference completion. The properties of the proposed certainty and conflict have been studied empirically, and the proposed approach has been experimentally validated compared to state-of-arts approaches with several data sets. © 2020, CC BY.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

KAN v.s. MLP for Offline Reinforcement Learning

arXiv

引用

arXiv 2024年

作者： Guo, Haihong Li, Fengxin Li, Jiao Liu, Hongyan School of Information Renmin University of China China Institute of Medical Information Medical Library Chinese Academy of Medical Sciences Peking Union Medical College China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Economics and Management Tsinghua University China

Kolmogorov-Arnold Networks (KAN) is an emerging neural network architecture in machine learning. It has greatly interested the research community about whether KAN can be a promising alternative of the commonly used Multi-Layer Perceptions (MLP). Experiments in various fields demonstrated that KAN-based machine learning can achieve comparable if not better performance than MLP-based methods, but with much smaller parameter scales and are more explainable. In this paper, we explore the incorporation of KAN into the actor and critic networks for offline reinforcement learning (RL). We evaluated the performance, parameter scales, and training efficiency of various KAN and MLP based conservative Q-learning (CQL) on the the classical D4RL benchmark for offline RL. Our study demonstrates that KAN can achieve performance close to the commonly used MLP with significantly fewer parameters. This provides us an option to choose the base networks according to the requirements of the offline RL tasks. © 2024, CC BY.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

VSM-RF: A method of relevance feedback in Keyword Search over Relational databases

VSM-RF: A method of relevance feedback in Keyword Search ove...

引用

IEEE International Symposium on Information (IT) in Medicine and Education, ITME

作者： Zhao-hui Peng Jun Zhang Shan Wang Chang-liang Wang Li-zhen Cui School of Computer Science and Technology Shandong University Jinan 250101 China School of Computer Science and Technology Dalian Maritime University 116026 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing 100872 China The Hong Kong University of Science and Technology China

In keyword search over relational databases (KSORD), retrieval of user's initial query is often unsatisfying. User has to reformulate his query and execute the new query, which costs much time and effort. In this paper, a method of automatically reformulating user queries by relevance feedback is introduced, which is named VSM-RF. Aimed at the results of KSORD systems, VSM-RF adopts a ranking method based on vector space model to rank KSORD results. After the first time of retrieval, using user feedback or pseudo feedback just as user like, VSM-RF computes expansion terms based on probability and reformulates the new query using query expansion. After KSORD systems executing the new query, more relevant results are produced by the new query in the result list and presented to user. Experimental results verify this method's effectiveness.

关键词： Feedback Keyword search Relational databases Computer science Information retrieval Laboratories data engineering knowledge engineering Computer science education Costs

来源：评论

学校读者我要写书评

暂无评论

Feature Aggregating Network with Inter-Frame Interaction for Efficient Video Super-Resolution

Feature Aggregating Network with Inter-Frame Interaction for...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yawei Li Zhao Zhang Suiyi Zhao Jicong Fan Haijun Zhang Mingliang Xu 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 Yunnan Key Laboratory of Software Engineering Kunming China Shenzhen Research Institute of Big Data Shenzhen China School of Data Science The Chinese University of Hong Kong Shenzhen China Department of Computer Science Harbin Institute of Technology Shenzhen China School of Computer and Artificial Intelligence Zhengzhou University Zhengzhou China

Video super-resolution (VSR) on mobile devices aims to restore high-resolution frames from their low-resolution counterparts, satisfying the requirements of performance, FLOPs and latency. On one hand, partial feature processing, as a classic and acknowledged strategy, is developed in current studies to reach an appropriate trade-off between FLOPs and accuracy. However, the splitting of partial feature processing strategy are usually performed in a blind manner, thereby reducing the computational efficiency and performance gains. On the other hand, current methods for mobile platforms primarily treat VSR as an extension of single-image super-resolution to reduce model calculation and inference latency. However, lacking inter-frame information interaction in current methods results in a suboptimal latency and accuracy trade-off. To this end, we propose a novel architecture, termed Feature Aggregating Network with Inter-frame Interaction (FANI), a lightweight yet considering frame-wise correlation VSR network, which could achieve real-time inference while maintaining superior performance. Our FANI accepts adjacent multi-frame low-resolution images as input and generally consists of several fully-connection-embedded modules, i.e., Multi-stage Partial Feature Distillation (MPFD) for capturing multi-level feature representations. Moreover, considering the importance of inter-frame alignment, we further employ a tiny Attention-based Frame Alignment (AFA) module to promote inter-frame information flow and aggregation efficiently. Extensive experiments on the well-known dataset and real-world mobile device demonstrate the superiority of our proposed FANI, which means that our FANI could be well adapted to mobile devices and produce visually pleasing results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Bring User Feedback into Keyword Search over databases

Bring User Feedback into Keyword Search over Databases

引用

Web Information Systems and Applications Conference (WISA)

作者： Zhaohui Peng Jun Zhang Shan Wang Changliang Wang School of Computer Science & Technology Shandong University Jinan China Key Laboratory of Data Engineering & Knowledge Engineering Ministry of Education Beijing China School of Computer Science & Technology Dalian Maritime University Dalian China Hong Kong University of Science and Technology Hong Kong China

Keyword search over relational databases (KSORD) enables casual users to use keyword queries (a set of keywords) to search relational databases just like searching the Web, without any knowledge of the database schema or any need of writing SQL queries. In KSORD, retrieval of user's initial query is often unsatisfying. User has to reformulate his query and execute the new query, which costs much time and effort. A method of automatically reformulating user queries by user feedback aimed at the results of KSORD is introduced in this paper, which is named UFBP (user feedback based on probability). After the first time of retrieval, according to the users' feedback information, UFBP computes terms to be added into the expanded query based on probability and reformulates the new query using query expansion. After KSORD executing the new query automatically, more relevant results are presented to user. Experimental results verify its effectiveness.

关键词： Feedback Keyword search Relational databases Tree graphs Information retrieval Computer science Educational technology Writing Information systems Application software

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：