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

Fine-grained attribute-aware analysis for person re-identification

Procedia computer science 2022年 199卷 276-283页

作者： Kunlong Bai Saiji Fu Linrui Yang Dalian Liu School of Computer Science & Technology University of Chinese Academy of Sciences Beijing 100049 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences No. 80 of Zhongguancun East Street Haidian District Beijing 100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences No. 80 of Zhongguancun East Street Haidian District Beijing 100190 China School of Economics and Management University of Chinese Academy of Sciences No. 80 of Zhongguancun East Street Haidian District Beijing 100190 China Sino-Danish College University of Chinese Academy of Sciences Beijing 100049 China Institute of Mathematics and Physics Beijing Union University Beijing 100101 China Institute of Fundamental and Interdisciplinary Sciences Beijing Union University Beijing 100101 China

How and where to learn the discriminative feature has always been a critical issue of person re-identification (re-ID). Most of the previous methods focus on extracting global representation from overall identity image and lack of high-level semantic attribute information. Based on the considerations above, we focus on looking for a way to make people’s attribute play a role in person re-identification task. In this paper, a novel multitask-like network, namely, Attribute-Identity Complementary Network (AICNet), is designed. It contains two branches to learn the identity and attribute feature separately, and a reciprocal interaction process is added to enrich the discrimination of the resulting feature. In addition, in order to better extract high-level semantic attribute information, multi-scale features are combined in the process of attribute extraction. With the help of this attribute-identity complementary strategy, the generated feature can be guided to learn most distinctive attribute feature that is most relevant to identity feature. The present paper carries out extensive experiments on two large-scale datasets, including Market-1501, and DukeMTMC-reID, after which it is found that our attribute-identity complementary framework significantly outperforms the baseline model and achieves competitive performance compared with the state-of-the-art person re-ID methods.

关键词： Person re-identification Attribute recognition Multi-task learning Deep neural network

来源：评论

学校读者我要写书评

暂无评论

A Margin-based MLE for Crowdsourced Partial Ranking

arXiv

引用

arXiv 2018年

作者： Xu, Qianqian Xiong, Jiechao Sun, Xinwei Yang, Zhiyong Cao, Xiaochun Huang, Qingming Yao, Yuan Key Lab of Intell. Info. Process. Inst. of Comput. Tech. Cas Beijing100190 Tencent Ai Lab Shenzhen518057 School of Mathematical Sciences Peking University Beijing100871 China DeepWise Ai Lab Beijing100085 Inst. of Info. Engin. Cas Beijing100093 China University of Chinese Academy of Sciences Beijing100049 China Key Lab of Big Data Mining and Knowledge Management Cas Beijing100190 Department of Mathematics Hong Kong University of Science and Technology Hong Kong Hong Kong

A preference order or ranking aggregated from pairwise comparison data is commonly understood as a strict total order. However, in real-world scenarios, some items are intrinsically ambiguous in comparisons, which may very well be an inherent uncertainty of the data. In this case, the conventional total order ranking can not capture such uncertainty with mere global ranking or utility scores. In this paper, we are specifically interested in the recent surge in crowdsourcing applications to predict partial but more accurate (i.e., making less incorrect statements) orders rather than complete ones. To do so, we propose a novel framework to learn some probabilistic models of partial orders as a margin-based Maximum Likelihood Estimate (MLE) *** prove that the induced MLE is a joint convex optimization problem with respect to all the parameters, including the global ranking scores and margin parameter. Moreover, three kinds of generalized linear models are studied, including the basic uniform model, Bradley-Terry model, and Thurstone-Mosteller model, equipped with some theoretical analysis on FDR and Power control for the proposed methods. The validity of these models are supported by experiments with both simulated and real-world datasets, which shows that the proposed models exhibit improvements compared with traditional state-ofthe-art algorithms. Copyright © 2018, The Authors. All rights reserved.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

Exploring outliers in crowdsourced ranking for QoE

arXiv

引用

arXiv 2017年

作者： Xu, Qianqian Yan, Ming Huang, Chendi Xiong, Jiechao Huang, Qingming Yao, Yuan Institute of Information Engineering Cas Beijing100093 Department of Computational Mathematics Michigan State University East LansingMI48824 United States BICMR-LMAM-LMEQF-LMP School of Mathematical Sciences Peking University Beijing100871 Tencent Ai Lab Shenzhen518057 University of Chinese Academy of Sciences Beijing100049 China Key Lab of Intell. Info. Process. Inst. of Comput. Tech. Cas Beijing100190 Key Lab of Big Data Mining and Knowledge Management Cas Beijing100190 Department of Mathematics Hong Kong University of Science and Technology 100871 Hong Kong

Outlier detection is a crucial part of robust evaluation for crowd-sourceable assessment of Quality of Experience (QoE) and has attracted much attention in recent years. In this paper, we propose some simple and fast algorithms for outlier detection and robust QoE evaluation based on the nonconvex optimization principle. Several iterative procedures are designed with or without knowing the number of outliers in samples. Theoretical analysis is given to show that such procedures can reach statistically good estimates under mild conditions. Finally, experimental results with simulated and real-world crowdsourcing datasets show that the proposed algorithms could produce similar performance to Huber-LASSO approach in robust ranking, yet with nearly 8 or 90 times speed-up, without or with a prior knowledge on the sparsity size of outliers, respectively. Therefore the proposed methodology provides us a set of helpful tools for robust QoE evaluation with crowdsourcing data. Copyright © 2017, The Authors. All rights reserved.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

knowledge graph embedding translation based on constraints

引用

Journal of Information Hiding and Multimedia Signal Processing 2017年第5期8卷 1119-1131页

作者： Wu, Yunbing Pan, Jengshyang Lu, Ping Lin, Kaibiao Yu, Xiaoyan College of Mathematics and Computer Science Fuzhou University No.2. Xueyuan Road University Town Minhou Fuzhou CityFujian Province350116 China Fujian Provincial Key Lab of Big Data Mining and Applications Fujian University of Technology No.3. Xueyuan Road University Town Minhou Fuzhou CityFujian Province350118 China Department of Business Xiamen University of Technology No.600 Ligong Road Jimei District XiamenFujian Province361024 China School of Computer and Information Engineering Xiamen University of Technology No.600 Ligong Road Jimei District XiamenFujian Province361024 China

knowledge graph reasoning is discovering new entity relations by computing and inference from existing relations. However, most reasoning models of translation embedding-based knowledge graphs have not considered the semantic-type constraints of relations in the construction of corrupted triplets. Hence, the constructed corrupted triplets may not conform to the actual semantic information and may, thus, significantly affect the prediction accuracy of the model. Therefore, we propose a constraint-based embedding model in this paper. First, the model establishes the head and tail entity set for each relationship. Then, it ensures that both the replacing head and tail entities in the corrupted triplet belong to the respective entity set so that the corrupted triplets that do not conform to the responding semantic relations are excluded. To evaluate the proposed model, we conduct link prediction and triple classification on WordNet and Freebase databases. The experimental results show that our method remarkably improves the performance compared to several state-of-the-art baselines. © 2017, Ubiquitous International. All rights reserved.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Social Bot Detection via Structural Information Theory

arXiv

引用

arXiv 2024年

作者： Peng, Hao Zhang, Jingyun Huang, Xiang Hao, Zhifeng Li, Angsheng Yu, Zhengtao Yu, Philip S. School of Cyber Science and Technology Beihang University No. 37 Xue Yuan Road Haidian District Beijing100191 China State Key Laboratory of Public Big Data Guizhou University No. 2708 South Section of Huaxi Avenue Huaxi District Guizhou Province Guiyang City550025 China Guangxi Key Lab of Multi-source Information Mining & Security Guangxi Normal University Guilin541004 China Yunnan Key Laboratory of Artificial Intelligence Kunming University of Science and Technology Kunming650500 China College of Science University of Shantou No. 243 University Road Shantou515063 China School of Computer Science and Engineering Beihang University No. 37 Xue Yuan Road Haidian District Beijing100191 China Faculty of Information Engineering and Automation Yunnan Key Laboratory of Artificial Intelligence Kunming University of Science and Technology Kunming650500 China Department of Computer Science University of Illinois at Chicago ChicagoIL60607 United States

Research on social bot detection plays a crucial role in maintaining the order and reliability of information dissemination while increasing trust in social interactions. The current mainstream social bot detection models rely on black-box neural network technology, e.g., Graph Neural Network, Transformer, etc., which lacks interpretability. In this work, we present UnDBot, a novel unsupervised, interpretable, yet effective and practical framework for detecting social bots. This framework is built upon structural information theory. We begin by designing three social relationship metrics that capture various aspects of social bot behaviors: Posting Type Distribution, Posting Influence, and Follow-to-follower Ratio. Three new relationships are utilized to construct a new, unified, and weighted social multi-relational graph, aiming to model the relevance of social user behaviors and discover long-distance correlations between users. Second, we introduce a novel method for optimizing heterogeneous structural entropy. This method involves the personalized aggregation of edge information from the social multi-relational graph to generate a two-dimensional encoding tree. The heterogeneous structural entropy facilitates decoding of the substantial structure of the social bots network and enables hierarchical clustering of social bots. Thirdly, a new community labeling method is presented to distinguish social bot communities by computing the user's stationary distribution, measuring user contributions to network structure, and counting the intensity of user aggregation within the community. Compared with ten representative social bot detection approaches, comprehensive experiments demonstrate the advantages of effectiveness and interpretability of UnDBot on four real social network datasets. Copyright © 2024, The Authors. All rights reserved.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

An automatic biomedical ontology meta-matching technique

Journal of Network Intelligence

引用

Journal of Network Intelligence 2019年第3期4卷 109-113页

作者： Xue, Xingsi Yang, Haiyan Zhang, Jie Zhang, Jing Chen, Dongxu College of Information Science and Engineering Intelligent Information Processing Research Center Fujian Key Lab for Automotive Electronics and Electric Drive Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology No.3 Xueyuan Road University Town Minhou Fuzhou CityFujian Province350118 China College of Information Science and Engineering Fujian University of Technology No.33 Xuefu South Road University Town Minhou Fuzhou CityFujian Province350118 China School of Computer Science and Engineering Yulin Normal University No.299 Education Middle Road Yulin CityGuanxi Province537000 China School of Computing Ulster University Jordanstown BT370QB United Kingdom Fujian Medical University Union Hospital No.29 Xinquan Road Gulou Fuzhou CityFujian Province350001 China

Biomedical ontology matching aims at determining the heterogeneous biomed-ical concepts, and bridging the semantic gap between heterogeneous biomedical ontologies. The foundation of a biomedical ontology matching technique is the Biomedical Concept Similarity Measure (BCSM), which calculates the similarity value between two biomed-ical concepts. Since various BCSMs have different advantages, usually several BCSMs are aggregated together to improve the result’s confidence. How to tune the aggregating weights to ensure the quality of the alignment is called biomedical ontology meta-matching problem, which is a challenge in the ontology matching domain. Currently, researchers mainly focus on how to tune the aggregating weights for various similarity measures to improve the quality of the ontology alignments. However, the ignorance of the effects brought about by different biomedical concept mapping’s preference on different similarity measures significantly reduces the alignment’s quality. To overcome this drawback, in this work, we formally define the biomedical ontology meta-matching problem, and then present an Ordered Weighted Average (OWA) based approach to automatically aggregate various biomedical concept similarity measures. In our method, the aggregating weights determined for each concept mapping is associated with the ordered position of the similarity value instead of a particular concept similarity measure. The experiment utilizes the large biomed track provided by Ontology Alignment Evaluation Initiative (OAEI) to test our proposal’s performance, and the experimental results show the effectiveness of our proposal. © 2019, Taiwan Ubiquitous Information. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

mining Repetitive Negative Sequential Patterns With Gap Constraints

引用

ACM Transactions on knowledge Discovery from data 1000年

作者： Yan Li Zhulin Wang Jing Liu Lei Guo Philippe Fournier-Viger Youxi Wu Xindong Wu School of Economics and Management Hebei University of Technology China School of Artificial Intelligence Hebei University of Technology China State Key Laboratory of Reliability and Intelligence of Electrical Equipment Hebei University of Technology China College of Computer Science and Software Engineering Shenzhen University China School of Artificial Intelligence Hebei University of Technology China and Hebei Key Laboratory of Big Data Computing China the Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology China

Sequential pattern mining (SPM) with gap constraints (or repetitive SPM or tandem repeat discovery in bioinformatics) can find frequent repetitive subsequences satisfying gap constraints, which are called positive sequential patterns with gap constraints (PSPGs). However, classical SPM with gap constraints cannot find the frequent missing items in the PSPGs. To tackle this issue, this paper explores negative sequential patterns with gap constraints (NSPGs). We propose an efficient NSPG-Miner algorithm that can mine both frequent PSPGs and NSPGs simultaneously. To effectively reduce candidate patterns, we propose a pattern join strategy with negative patterns which can generate both positive and negative candidate patterns at the same time. To calculate the support (frequency of occurrence) of a pattern in each sequence, we explore a NegPair algorithm that employs a key-value pair array structure to deal with the gap constraints and the negative items simultaneously and can avoid redundant rescanning of the original sequence, thus improving the efficiency of the algorithm. To report the performance of NSPG-Miner, 11 competitive algorithms and 11 datasets are employed. The experimental results not only validate the effectiveness of the strategies adopted by NSPG-Miner, but also verify that NSPG-Miner can discover more valuable information than the state-of-the-art algorithms. Algorithms and datasets can be downloaded from https://***/wuc567/Pattern-mining/tree/master/NSPG-Miner.

关键词： sequential pattern mining gap constraint negative sequential pattern key-value pair

来源：评论

学校读者我要写书评

暂无评论

Applications of Game Theory in Vehicular Networks: A Survey

arXiv

引用

arXiv 2021年

作者： Sun, Zemin Liu, Yanheng Wang, Jian Li, Guofa Anil, Carie Li, Keqiang Guo, Xinyu Sun, Geng Tian, Daxin Cao, Dongpu College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Institute of Human Factors and Ergonomics College of Mechatronics and Control Engineering Shenzhen University Guangdong Shenzhen518060 China School of Computer Science and Engineering VIT-AP Andhra Pradesh Amaravati522237 India College of Engineering Nanjing Agricultural University Nanjing210031 China State Key Laboratory of Automotive Safety and Energy Department of Automotive Engineering Tsinghua University Beijing100084 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control School of Transportation Science and Engineering Beihang University Beijing100191 China Waterloo Cognitive Autonomous Driving Lab University of Waterloo N2L 3G1 Canada

In the Internet of things (IoT) era, vehicles and other intelligent components in an intelligent transportation system (ITS) are connected, forming vehicular networks (VNs) that provide efficient and safe traffic and ubiquitous access to various applications. However, as the number of nodes in an ITS increases, it is challenging to satisfy a varied and large number of service requests with different quality of service (QoS) and security requirements in highly dynamic VNs. Intelligent nodes in VNs can compete or cooperate for limited network resources to achieve the objective for either an individual or a group. Game theory (GT), a theoretical framework designed for strategic interactions among rational decision makers sharing scarce resources, can be used to model and analyze individual or group behaviors of communicating entities in VNs. This paper primarily surveys the recent developments of GT in solving various challenges of VNs. This survey starts with an introduction to the background of VNs. A review of GT models studied in the VNs is then introduced, including the basic concepts, classifications, and applicable vehicular issues. After discussing the requirements of VNs and the motivation of using GT, a comprehensive literature review on GT applications in dealing with the challenges of current VNs is provided. Furthermore, recent contributions of GT to VNs that are integrated with diverse emerging 5G technologies are surveyed. Finally, the lessons learned are given, and several key research challenges and possible solutions of applying GT in VNs are outlined. Copyright © 2021, The Authors. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

An Integrated Tone Mapping for High Dynamic Range Image Visualization

引用

Journal of Physics: Conference Series 2018年第1期960卷

作者： Lei Liang Jeng-Shyang Pan Yongjun Zhuang Department of Computer Science and Technology Shenzhen Graduate School Harbin Institute of Technology Shenzhen China Qihan Research Qihan Technology Co. LTD Shenzhen China Fujian Provincial Key Lab of Big Data Mining and Applications Fujian University of Techology Fujian China

There are two type tone mapping operators for high dynamic range (HDR) image visualization. HDR image mapped by perceptual operators have strong sense of reality, but will lose local details. Empirical operators can maximize local detail information of HDR image, but realism is not strong. A common tone mapping operator suitable for all applications is not available. This paper proposes a novel integrated tone mapping framework which can achieve conversion between empirical operators and perceptual operators. In this framework, the empirical operator is rendered based on improved saliency map, which simulates the visual attention mechanism of the human eye to the natural scene. The results of objective evaluation prove the effectiveness of the proposed solution.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Author Correction:data augmentation in microscopic images for material data mining

引用

npj Computational Materials 2020年第1期6卷 476-476页

作者： Boyuan Ma Xiaoyan Wei Chuni Liu Xiaojuan Ban Haiyou Huang Hao Wang Weihua Xue Stephen Wu Mingfei Gao Qing Shen Michele Mukeshimana Adnan Omer Abuassba Haokai Shen Yanjing Su Beijing Advanced Innovation Center for Materials Genome Engineering University of Science and Technology Beijing Beijing China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing China Institute for Advanced Materials and Technology University of Science and Technology Beijing Beijing China School of Materials Science and Engineering University of Science and Technology Beijing Beijing China School of Materials Science and Technology Liaoning Technical University Liaoning China The Institute of Statistical Mathematics Research Organization of Information and Systems Tachikawa Tokyo Japan National Intellectual Property Administration Beijing China Faculty of Engineering Sciences University of Burundi Bujumbura Burundi Faculty of Engineering and Technology Palestine Technical University – Kadoorie Tulkarem Palestine College of Information Science and Engineering China University of Petroleum Beijing China Key Lab of Petroleum Data Mining China University of Petroleum Beijing China

The original version of this article omitted the following from the Acknowledgements:“This work was supported by Beijing Top Discipline for Artificial Intelligent science and Engineering,University of science and Tec... 详细信息

关键词： HTML knowledge mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：