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

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： Tao Zhang Zhen Y ang Bo Mao Jian Y ang Yifang Ban Huilin Xiong Shanghai Key Lab. of Intelligent Sensing and Recognition Shanghai Jiao Tong University Shanghai China Jiangxi Science and Technology Normal University Nanchang China Jiangsu Key Laboratory of Grain Big Data Mining and Application Nanjing University of Finance & Economics Nanjing China Department of Electronic Engineering Tsinghua University Beijing China Division of Geoinformatics KTH Royal Institute of Technology Stockholm Sweden

Sea surface and ship have different backscattering mechanisms, in which surface scattering is predominant for sea surface in the low sea state case. Based on this fact, many ship detectors have been developed by suppressing the surface scattering resulted from sea surface. Actually, small ship may also have strong surface scattering sometimes. In such a case, the methods of avoiding using surface scattering features may easily miss the detection of small ships. To verify this point, in this paper, we first analyze the shortcomings of An's method which is based on surface scattering similarity and the power maximization synthesis detector (PMS), and then improve it for detecting small ships more effectively. In order to demonstrate the performance of the proposed method, AIRSAR L-Band Polarimetric SAR dataset is exploited. Comparing to other methods, the new method shows a better ship detection performance.

关键词： Marine vehicles Scattering Sea surface Covariance matrices Detectors Synthetic aperture radar Backscatter

来源：评论

学校读者我要写书评

暂无评论

Structure-aware random fourier kernel for graphs 21

Structure-aware random fourier kernel for graphs

引用

Proceedings of the 35th International Conference on Neural Information Processing Systems

作者： Jinyuan Fang Qiang Zhang Zaiqiao Meng Shangsong Liang School of Computer Science and Engineering Sun Yat-sen University China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Hangzhou Innovation Center Zhejiang University China and College of Computer Science and Technology Zhejiang University China and AZFT Knowledge Engine Lab China School of Computing Science University of Glasgow United Kingdom and Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates School of Computer Science and Engineering Sun Yat-sen University China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China and Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates

ISBN: (纸本)9781713845393

Gaussian Processes (GPs) define distributions over functions and their generalization capabilities depend heavily on the choice of kernels. In this paper, we propose a novel structure-aware random Fourier (SRF) kernel for GPs that brings several benefits when modeling graph-structured data. First, SRF kernel is defined with a spectral distribution based on the Fourier duality given by the Bochner's theorem, transforming the kernel learning problem to a distribution inference problem. Second, SRF kernel admits a random Fourier feature formulation that makes the kernel scalab.e for optimization. Third, SRF kernel enables to leverage geometric structures by taking subgraphs as inputs. To effectively optimize GPs with SRF kernel, we develop a variational EM algorithm, which alternates between an inference procedure (E-step) and a learning procedure (M-step). Experimental results on five real-world datasets show that our model can achieve state-of-the-art performance in two typical graph learning tasks, i.e., object classification and link prediction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Triplet Deep Subspace Clustering via Self-Supervised data Augmentation

Triplet Deep Subspace Clustering via Self-Supervised Data Au...

引用

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Xianzhen Li Haijun Zhang Yi Yang Shuicheng Yan Meng Wang 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 Computer Science and Technology Soochow University Suzhou China Harbin Institute of Technology (Shenzhen) Shenzhen China Centre for Artificial Intelligence University of Technology Sydney Sydney NSW Australia Sea AI Lab (SAIL) & National University of Singapore Singapore

ISBN: (纸本)9781665423991

Deep subspace clustering (DSC) with the auto-encoder and self-expression layer is of great concern due to encouraging performance. However, existing methods usually adopt a “single-task” strategy based on a single dataset, without considering other related tasks or data. As such, they cannot discover other useful information to improve the clustering task. Besides, the local structure preservation of the latent codes in mapping is usually ignored. In this paper, we therefore present an effective “multi-task” strategy via the self-supervised data augmentation, and propose a new end-to-end trainable Triplet Deep Subspace Clustering Network (TDSC-net). Specifically, TDSC-net firstly generates triplet data (i.e., anchor, positive and negative data) from input data by a spectral clustering module and a self-supervised data augmentation module. This can enable it to inherit the merits of self-supervised learning and multitask learning implicitly. After that, TDSC-net builds a triplet deep autoencoder network with a self-expression layer, which takes the triplet data as input, where they share the common network layers (i.e., autoencoder and self-expression layers) over the triple tasks for complementary learning and mutual supervision. A triplet loss is also included to retain the local information of deep latent codes, which will also benefit the self-expression. Furthermore, TDSC-net separates the self-expression layer from decoding process to improve the efficiency of reconstruction. Extensive results on several public datasets demonstrate the effectiveness of our triplet-task DSC strategy.

关键词： Codes Conferences Multitasking Decoding data mining Task analysis

来源：评论

学校读者我要写书评

暂无评论

Disentangled Noisy Correspondence Learning

arXiv

引用

arXiv 2024年

作者： Dang, Zhuohang Luo, Minnan Wang, Jihong Jia, Chengyou Han, Haochen Wan, Herun Dai, Guang Chang, Xiaojun Wang, Jingdong The School of Computer Science and Technology The Ministry of Education Key Laboratory of Intelligent Networks and Network Security The Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Shaanxi Xi'An710049 China SGIT AI Lab State Grid Shaanxi Electric Power Company Limited State Grid Corporation of China Shaanxi China The School of Information Science and Technology University of Science and Technology China United Arab Emirates The Baidu Inc China

Cross-modal retrieval is crucial in understanding latent correspondences across modalities. However, existing methods implicitly assume well-matched training data, which is impractical as real-world data inevitably involves imperfect alignments, i.e., noisy correspondences. Although some works explore similarity-based strategies to address such noise, they suffer from sub-optimal similarity predictions influenced by modality-exclusive information (MEI), e.g., background noise in images and abstract definitions in texts. This issue arises as MEI is not shared across modalities, thus aligning it in training can markedly mislead similarity predictions. Moreover, although intuitive, directly applying previous cross-modal disentanglement methods suffers from limited noise tolerance and disentanglement efficacy. Inspired by the robustness of information bottlenecks against noise, we introduce DisNCL, a novel information-theoretic framework for feature Disentanglement in Noisy Correspondence Learning, to adaptively balance the extraction of MII and MEI with certifiable optimal cross-modal disentanglement efficacy. DisNCL then enhances similarity predictions in modality-invariant subspace, thereby greatly boosting similarity-based alleviation strategy for noisy correspondences. Furthermore, DisNCL introduces soft matching targets to model noisy many-to-many relationships inherent in multi-modal input for noise-robust and accurate cross-modal alignment. Extensive experiments confirm DisNCL's efficacy by 2% average recall improvement. Mutual information estimation and visualization results show that DisNCL learns meaningful MII/MEI subspaces, validating our theoretical analyses. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Large scale report generation in data consolidation environments of banks

引用

Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition) 2012年第SUPPL.1期40卷 5-8页

作者： Qin, Xiongpai Zhou, Xiaoyun Wu, Zhongxin Yang, Hongzhi Wang, Wei Ministry of Education Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China Information School Renmin University of China Beijing 100872 China Computer Science Department Jiangsu Normal University Xuzhou 221116 Jiangsu China Beijing Nantian Software Co. Ltd. Beijing 100085 China

To generate large number of reports in a limited time window, four techniques were proposed, including ROLAP&SQL, Shared Scanning, Hadoop based Solution, and MOLAP&Cube Sharding, an algorithm that performs in memory aggregation was designed for the second solution. The experiment results show that all techniques except ROLAP&SQL can meet the time window constraint, the Hadoop based solution is a promising technique owe to its highly scalab.lity. Considering maturity of the techniques and their performance, we put MOLAP&Cube Sharding into practice while keeping an eye on Hadoop for future adoption.

关键词： Custom report data consolidation Hadoop Large bank MOLAP ROLAP

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Erratum to “Entropy-based fuzzy support vector machine for imbalanced datasets” [Knowl.-Based Syst. 115 (2017) 87–99]

引用

knowledge-Based Systems 2020年 192卷

作者： Salim Rezvani Xizhao Wang Big Data Institute College of Computer Science and Software Engineering Guangdong Key Lab. of Intelligent Information Processing Shenzhen University Shenzhen 518060 Guangdong China

In this note, we show that the calculation of statistics X F 2 and F F in sections 4.5 and 4.6 of the paper (Fan et al., 2017) is not correct. Also, based on the calculation of Critical Difference (CD) of Bonferroni–Dunn test, we show that the conclusion on ”significantly outperforming the compared algorithms”, drawn by the authors using the P -value test, is not convincing.

关键词： Information entropy fuzzy support vector machine Bonferroni–Dunn test Friedman test

来源：评论

学校读者我要写书评

暂无评论

On-edge multi-task transfer learning: Model and practice with data-driven task allocation

arXiv

引用

arXiv 2021年

作者： Zheng, Zimu Chen, Qiong Hu, Chuang Wang, Dan Liu, Fangming The National Engineering Research Center for Big Data Technology and System Key Laboratory of Services Computing Technology and System Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China The Edge Cloud Innovation Lab. Technical Innovation Department Cloud BU Huawei Technologies Co. Ltd. Shenzhen China The Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong Hong Kong

On edge devices, data scarcity occurs as a common problem where transfer learning serves as a widely-suggested remedy. Nevertheless, transfer learning imposes heavy computation burden to the resource-constrained edge devices. Existing task allocation works usually assume all submitted tasks are equally important, leading to inefficient resource allocation at a task level when directly applied in Multi-task Transfer Learning (MTL). To address these issues, we first reveal that it is crucial to measure the impact of tasks on overall decision performance improvement and quantify task importance. We then show that task allocation with task importance for MTL (TATIM) is a variant of NP-complete Knapsack problem, where the complicated computation to solve this problem needs to be conducted repeatedly under varying contexts. To solve TATIM with high computational efficiency, we propose a data-driven Cooperative Task Allocation (DCTA) approach. Finally, we evaluate the performance of DCTA by not only a trace-driven simulation, but also a new comprehensive real-world AIOps case study which bridges model and practice via a new architecture and main components design within AIOps system. Extensive experiments show that our DCTA reduces 3.24 times of processing time, and saves 48.4% energy consumption compared with the state-of-the-art when solving TATIM. Copyright © 2021, The Authors. All rights reserved.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Global Collab.ration to Enhance Information Technology & Quantitative Management: Preface for ITQM 2023

引用

Procedia Computer Science 2023年 221卷 xv-xvii页

作者： Shi, Yong Filip, Florin G. He, Jing Li, Jianping Kou, Gang Tien, James Berg, Daniel Research Centre on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Lab of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China Romanian Academy Calea Victoriei 125 Sector 1 Bucharest010071 Romania College of Information Science and Technology University of Nebraska at Omaha OmahaNE68182 United States University of Oxford United Kingdom School of Business Chengdu University Sichuan 610106 China College of Engineering University of Miami Coral GablesFL33124 United States

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：