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

arXiv 2022年

作者： Li, Jiangmeng Qiang, Wenwen Zheng, Changwen Su, Bing Xiong, Hui Science & Technology on Integrated Information System Laboratory Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Guangdong China Gaoling School of Artificial Intelligence Renmin University of China Beijing China Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing China Guangzhou China Department of Computer Science Engineering The Hong Kong University of Science and Technology Hong Kong

What matters for contrastive learning? We argue that contrastive learning heavily relies on informative features, or "hard" (positive or negative) features. Early works include more informative features by applying complex data augmentations and large batch size or memory bank, and recent works design elaborate sampling approaches to explore informative features. The key challenge toward exploring such features is that the source multi-view data is generated by applying random data augmentations, making it infeasible to always add useful information in the augmented data. Consequently, the informativeness of features learned from such augmented data is limited. In response, we propose to directly augment the features in latent space, thereby learning discriminative representations without a large amount of input data. We perform a meta learning technique to build the augmentation generator that updates its network parameters by considering the performance of the encoder. However, insufficient input data may lead the encoder to learn collapsed features and therefore malfunction the augmentation generator. A new margin-injected regularization is further added in the objective function to avoid the encoder learning a degenerate mapping. To contrast all features in one gradient back-propagation step, we adopt the proposed optimization-driven unified contrastive loss instead of the conventional contrastive loss. Empirically, our method achieves state-of-the-art results on several benchmark datasets. Copyright © 2022, The Authors. All rights reserved.

关键词： Backpropagation

来源：评论

学校读者我要写书评

暂无评论

An Optimizing Parameters and Feature Selection in SVM Based on Improved Cockroach Swarm Optimization 16th

An Optimizing Parameters and Feature Selection in SVM Based ...

引用

16th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2020 in conjunction with the 13th International Conference on Frontiers of Information Technology, Applications and Tools, FITAT 2020

作者： Nguyen, Trong-The Yu, Jie Nguyen, Thi-Thanh-Tan Lai, Quoc-Anh Ngo, Truong-Giang Dao, Thi-Kien Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou China College of Mechanical and Automotive Engineering Fujian University of Technology Fuzhou China Information Technology Faculty Electric Power University Hanoi Viet Nam Department of Pattern Recognition & Image Processing Institute of Information Technology Vietnam Academy of Science and Technology Hanoi Viet Nam Faculty of Computer Science and Engineering Thuyloi University 175 Tay Son Dong Da Hanoi Viet Nam

ISBN: (纸本)9789813367562

This study improves a classifier of the support vector machine (SVM) by optimizing its parameters by adjusting cockroach swarm optimization (CSO). Classification system design includes data inputs, pre-process, and classification. The relief technique selects the feature subset, and the kernel parameters used as input for the system. The feature selection and classification of data sets were figured out by the combination of ICSO and SVM with its optimized parameters synchronous. Simulation results of the proposed scheme are compared with other systems, e.g., GA-SVM, PSO-SVM, and CSO-SVM, which show that the proposed project can achieve better classification accuracy than the different algorithms. It is promising that the proposed scheme can be applied to high-dimensional data classification, such as image classification, signal classification. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2021.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Interventional Contrastive Learning with Meta Semantic Regularizer

arXiv

引用

arXiv 2022年

作者： Qiang, Wenwen Li, Jiangmeng Zheng, Changwen Su, Bing Xiong, Hui Science & Technology on Integrated Information System Laboratory Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Guangdong China Gaoling School of Artificial Intelligence Renmin University of China Beijing China Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing China Guangzhou China Department of Computer Science & Engineering The Hong Kong University of Science and Technology Hong Kong

Contrastive learning (CL)-based self-supervised learning models learn visual representations in a pairwise manner. Although the prevailing CL model has achieved great progress, in this paper, we uncover an ever-overlooked phenomenon: When the CL model is trained with full images, the performance tested in full images is better than that in foreground areas;when the CL model is trained with foreground areas, the performance tested in full images is worse than that in foreground areas. This observation reveals that backgrounds in images may interfere with the model learning semantic information and their influence has not been fully eliminated. To tackle this issue, we build a Structural Causal Model (SCM) to model the background as a confounder. We propose a backdoor adjustment-based regularization method, namely Interventional Contrastive Learning with Meta Semantic Regularizer (ICL-MSR), to perform causal intervention towards the proposed SCM. ICL-MSR can be incorporated into any existing CL methods to alleviate background distractions from representation learning. Theoretically, we prove that ICL-MSR achieves a tighter error bound. Empirically, our experiments on multiple benchmark datasets demonstrate that ICL-MSR is able to improve the performances of different state-of-the-art CL methods. Copyright © 2022, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Graph-Order Optimization Algorithm Based on Equal-in-Space Distance Model for High-Resolution Image Matting

Graph-Order Optimization Algorithm Based on Equal-in-Space D...

引用

IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)

作者： Fujian Feng Han Huang Yihui Liang School of Software Engineering South China University of Technology Guangzhou China School of Data Science and Information Engineering Guizhou Minzu University Guiyang China Key Laboratory of Big Data and Intelligent Robot South China University of Technology Ministry of Education Guangzhou China School of Computer Science Zhongshan Institute University of Electronic Science and Technology of China Zhongshan China

ISBN: (纸本)9781665441506

Image matting is an essential image processing technology. optimized-based image matting methods can significantly improve the alpha matte quality of high-resolution images. However, the local information of the foreground may be similar to the background, which causes the inversion problem of the alpha matte in the single-point optimized. In this paper, we propose an image matting mathematical model of the equal-in-space distance. The model transforms the high-resolution image matting problem into several small-scale combinatorial optimization problems according to the similarity among pixel features. Inspired by spanning tree, we propose a graph-order optimization strategy, which generates the optimization sequence of small-scale optimization problems according to the edge weight among graph nodes. In addition, we designed a graph-order optimization algorithm based on optimized information transfer to solve each node in the graph. Experimental results show that the proposed model solves the alpha matte inversion problem of single-point optimization matting. Besides, the proposed algorithm outperforms the state-of-the-art optimization algorithms for the high-resolution image matting problem.

关键词： Cloud computing Image processing Image edge detection Conferences Computational modeling Transforms Information processing

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence without Restriction Surpassing Human Intelligence with Probability One: Theoretical Insight into Secrets of the Brain with AI Twins of the Brain

arXiv

引用

arXiv 2024年

作者： Huang, Guang-Bin Westover, M. Brandon Tan, Eng-King Wang, Haibo Cui, Dongshun Ma, Wei-Ying Wang, Tiantong He, Qi Wei, Haikun Wang, Ning Tian, Qiyuan Lam, Kwok-Yan Yao, Xin Wong, Tien Yin School of Automation Southeast University Nanjing China Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of Education Nanjing China Beth Israel Deaconess Medical Center Harvard Medical School Boston United States Department of Neurology National Neuroscience Institute Singapore Research Centre of Big Data and Artificial Intelligence for Medicine First Affiliated Hospital of Sun Yat-Sen University Guangzhou China Duke-NUS Medical School National University of Singapore Singapore Mind PointEye Singapore Institute for AI Industry Research Tsinghua University Beijing China College of Computing and Data Science Nanyang Technological University Singapore School of Biomedical Engineering Tsinghua University Beijing China Singapore AI Safety Institute Nanyang Technological University Singapore School of Data Science Lingnan University Hong Kong School of Computer Science University of Birmingham United Kingdom Singapore Eye Research Institute Singapore National Eye Centre Singapore Tsinghua Medicine Tsinghua University Beijing China

Artificial Intelligence (AI) has apparently become one of the most important techniques discovered by humans in history while the human brain is widely recognized as one of the most complex systems in the universe. One fundamental critical question which would affect human sustainability remains open: Will artificial intelligence (AI) evolve to surpass human intelligence in the future? This paper shows that in theory new AI twins with fresh cellular level of AI techniques for neuroscience could approximate the brain and its functioning systems (e.g. perception and cognition functions) with any expected small error and AI without restrictions could surpass human intelligence with probability one in the end. This paper indirectly proves the validity of the conjecture made by Frank Rosenblatt 70 years ago about the potential capabilities of AI, especially in the realm of artificial neural networks. This paper also gives the answer to the two widely discussed fundamental questions: 1) whether AI could have potentials of discovering new principles in nature;2) whether error backpropagation (BP) algorithm commonly and efficiently used in tuning parameters in AI applications is also adopted in the brain. Intelligence is just one of fortuitous but sophisticated creations of the nature which has not been fully discovered. Like mathematics and physics, with no restrictions artificial intelligence would lead to a new subject with its self-contained systems and principles. We anticipate that this paper opens new doors for 1) AI twins and other AI techniques to be used in cellular level of efficient neuroscience dynamic analysis, functioning analysis of the brain and brain illness solutions;2) new worldwide collaborative scheme for interdisciplinary teams concurrently working on and modelling different types of neurons and synapses and different level of functioning subsystems of the brain with AI techniques;3) development of low energy of AI techniques with the aid of fundament

关键词： Neurology

来源：评论

学校读者我要写书评

暂无评论

Quadratic sparse Gaussian graphical model estimation method for massive variables 29

Quadratic sparse Gaussian graphical model estimation method ...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Zhang, Jiaqi Wang, Meng Li, Qinchi Wang, Sen Chang, Xiaojun Wang, Beilun College of Software Engineering Southeast University China School of Computer Science and Engineering Southeast University China School of Artificial Intelligence Southeast University China Electrical Engineering and Automation YOUPEI College Yancheng Institute of Technology China School of Information Technology and Electrical Engineering University of Queensland Australia Department of Data Science and AI Monash University Australia

ISBN: (纸本)9780999241165

We consider the problem of estimating a sparse Gaussian Graphical Model with a special graph topological structure and more than a million variables. Most previous scalable estimators still contain expensive calculation steps (e.g., matrix inversion or Hessian matrix calculation) and become infeasible in high-dimensional scenarios, where p (number of variables) is larger than n (number of samples). To overcome this challenge, we propose a novel method, called Fast and Scalable Inverse Covariance Estimator by Thresholding (FST). FST first obtains a graph structure by applying a generalized threshold to the sample covariance matrix. Then, it solves multiple block-wise subproblems via element-wise thresholding. By using matrix thresholding instead of matrix inversion as the computational bottleneck, FST reduces its computational complexity to a much lower order of magnitude (O(p2)). We show that FST obtains the same sharp convergence rate O(p(log max{p, n}/n) as other state-of-the-art methods. We validate the method empirically, on multiple simulated datasets and one real-world dataset, and show that FST is two times faster than the four baselines while achieving a lower error rate under both Frobenius-norm and max-norm. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

KFR: Optimal Cache Management with K-Framed Reclamation for Drive-Managed SMR Disks

KFR: Optimal Cache Management with K-Framed Reclamation for ...

引用

Design Automation Conference

作者： Chenlin Ma Yi Wang Zhaoyan Shen Zili Shao College of Big Data and Internet Shenzhen Technology University College of Computer Science and Software Engineering Shenzhen University School of Computer Science and Technology Shandong University Department of Computer Science and Engineering The Chinese University of Hong Kong

ISBN: (数字)9781728110851

ISBN: (纸本)9781728158020

Shingled Magnetic Recording (SMR) disks have been proposed as a promising solution to satisfy the increasing capacity need in the big data era. Drive-Managed SMR (DM-SMR) disk which acts as a traditional block device is favored for providing high compatibility. However, DM-SMR disks suffer from high performance recovery time (PRT) due to the "SMR space reclamation" issue. This paper proposes an optimal cache management named K-Framed Reclamation (KFR) to minimize PRT within the DM-SMR disk. The effectiveness of our proposed design was evaluated with realistic and intensive I/O workloads and the results are encouraging.

关键词： Delays Magnetic recording Writing big data computer science Performance evaluation Runtime

来源：评论

学校读者我要写书评

暂无评论

Record High Temperatures in the Ocean in 2024

引用

Advances in Atmospheric sciences 2025年第6期 1092-1109页

作者： Lijing CHENG John ABRAHAM Kevin E.TRENBERTH James REAGAN Huai-Min ZHANG Andrea STORTO Karina VON SCHUCKMANN Yuying PAN Yujing ZHU Michael E.MANN Jiang ZHU Fan WANG Fujiang YU Ricardo LOCARNINI John FASULLO Boyin HUANG Garrett GRAHAM Xungang YIN Viktor GOURETSKI Fei ZHENG Yuanlong LI Bin ZHANG Liying WAN Xingrong CHEN Dakui WANG Licheng FENG Xiangzhou SONG Yulong LIU Franco RESEGHETTI Simona SIMONCELLI Gengxin CHEN Rongwang ZHANG Alexey MISHONOV Zhetao TAN Wangxu WEI Huifeng YUAN Guancheng LI Qiuping REN Lijuan CAO Yayang LU Juan DU Kewei LYU Albertus SULAIMAN Michael MAYER Huizan WANG Zhanhong MA Senliang BAO Henqian YAN Zenghong LIU Chunxue YANG Xu LIU Zeke HAUSFATHER Tanguy SZEKELY Flora GUES National Key Laboratory of Earth System Numerical Modeling and Application Institute of Atmospheric PhysicsChinese Academy of Sciences University of St. Thomas School of Engineering NSF National Center for Atmospheric Research University of Auckland National Oceanic and Atmospheric Administration National Centers for Environmental Information National Research Council (CNR) Institute of Marine Sciences (ISMAR) Mercator Ocean International Department of Earth and Environmental Science University of Pennsylvania Institute of Oceanology Chinese Academy of Sciences National Marine Environmental Forecasting Center Ministry of Natural Resources of China North Carolina Institute for Climate Studies (NCICS) North Carolina State University Oceanographic Data Center Chinese Academy of Sciences College of Oceanography Hohai University National Marine Data and Information Service Istituto Nazionale di Geofisica eVulcanologia Sede di Bologna South China Sea Institute of Oceanology Chinese Academy of Sciences ESSIC/CISESS-MD University of Maryland Computer Network Information Center Chinese Academy of Sciences Eco-Environmental Monitoring and Research Center Pearl River Valley and South China Sea Ecology and Environment Administration Ministry of Ecology and Environment National Meteorological Information Center China Meteorological Administration International Research Center of Big Data for Sustainable Development Goals Xiamen University Research Center for Climate and Atmosphere National Research and Innovation Agency (BRIN) Research Department European Centre for Medium-Range Weather Forecasts Department of Meteorology and Geophysics University of Vienna College of Meteorology and Oceanography National University of Defense Technology State Key Laboratory of Satellite Ocean Environment Dynamics Second Institute of OceanographyMinistry of Natural Resources Stripe Inc. South San Francisco Ocean Scope CELAD

Heating in the ocean has continued in 2024 in response to increased greenhouse gas concentrations in the atmosphere,despite the transition from an El Ni?o to neutral conditions. In 2024, both global sea surface temperature(SST) and upper2000 m ocean heat content(OHC) reached unprecedented highs in the historical record. The 0–2000 m OHC in 2024exceeded that of 2023 by 16 ± 8 ZJ(1 Zetta Joules = 1021 Joules, with a 95% confidence interval)(IAP/CAS data), which is confirmed by two other data products: 18 ± 7 ZJ(CIGAR-RT reanalysis data) and 40 ± 31 ZJ(Copernicus Marine data,updated to November 2024). The Indian Ocean, tropical Atlantic, Mediterranean Sea, North Atlantic, North Pacific, and Southern Ocean also experienced record-high OHC values in 2024. The global SST continued its record-high values from2023 into the first half of 2024, and declined slightly in the second half of 2024, resulting in an annual mean of 0.61°C ±0.02°C(IAP/CAS data) above the 1981–2010 baseline, slightly higher than the 2023 annual-mean value(by 0.07°C ±0.02°C for IAP/CAS, 0.05°C ± 0.02°C for NOAA/NCEI, and 0.06°C ± 0.11°C for Copernicus Marine). The record-high values of 2024 SST and OHC continue to indicate unabated trends of global heating.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Correction to: Recent advances in multiple criteria decision making techniques

引用

International Journal of Machine Learning and Cybernetics 2021年第2期13卷 565-565页

作者： He, Yulin Wang, Xizhao Huang, Joshua Zhexue Big Data Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen China

来源：评论

学校读者我要写书评

暂无评论

Active learning in computational pathology with noise detection empowered by loss-based prior and feature analysis

引用

Biomedical Signal Processing and Control 2025年 108卷

作者： Huang, Yujian Li, Jinyang An, Hui Luo, Tong Ji, Zheyi Song, Yi Liu, Huijun U, Kaicheng Zhang, Sophia Meixuan Zhao, Junhan Ge, Yongxin School of Big Data and Software Engineering Chongqing University Chongqing401331 China College of Computer Science Chongqing University Chongqing401331 China Neurosurgery Department Chongqing University Three Gorges Hospital Chongqing404100 China Harvard College Harvard University Cambridge02138 United States College of Agriculture and Life Sciences Cornell University Ithaca14850 United States Department of Computational Oncology Memorial Sloan Kettering Cancer Center New York City10065 United States Tri-Institutional Computational Biology & Medicine Weill Cornell Medicine New York City10065 United States Department of Biomedical Informatics Harvard Medical School Boston02115 United States Department of Biostatistics Harvard T.H.Chan School of Public Health Boston02115 United States

AI-based histopathological image analysis has significantly advanced the field of computer-aided diagnosis. While labeled data can enhance model performance, manual annotation by pathologists is labor-intensive and time-consuming, with variability and reliance on coarse slide-level annotations often introducing noise. To address these challenges, we propose introduces BPAL (Beta Mixture Model and Penalized Regression for Active Learning), a novel active learning framework for histopathological whole-slide image analysis. BPAL aims to reduce expert annotation costs and mitigate the impact of noisy samples during training by autonomously managing highly informative samples in each active learning iteration. Our approach integrates two noise detection modules into active learning frameworks. By incorporating Penalized Regression (PR) with parallel computation capabilities into our framework, we enhance the efficiency of noisy sample detection. Leveraging a Beta Mixture Model (BMM) with prior loss knowledge further augments this process by enabling a comprehensive analysis from various angles within the merged feature and label spaces. This approach maximizes the utilization of information extracted from pathological image samples, ensuring a robust and thorough assessment of data quality. We propose a heuristic sampling strategy based on these enhancements. High-information samples identified by the module are categorized into three types: typical samples with high confidence levels that can receive pseudo labels for training, difficult samples requiring expert re-annotation due to complex features, and mislabeled noisy samples. The iterative addition of training sets retains high-information samples while mitigating the impact of noisy samples. Comparative evaluations demonstrate the superior performance of our approach on breast cancer and prostate cancer classification tasks. © 2025 Elsevier Ltd

关键词： Active learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：