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

Pivot probability induction for statistical machine translation with topic similarity

Journal of Computational Information Systems 2013年第20期9卷 8351-8359页

作者： Huang, Yanzhou Shi, Xiaodong Su, Jinsong Chen, Yidong Huang, Guimin Fujian Key Lab. of the Brain-Like Intelligent Systems Xiamen University Xiamen 361005 China Department of Cognitive Science School of Information Science and Technology Xiamen University Xiamen 361005 China School of Software Xiamen University Xiamen 361005 China Research Center on Data Science and Social Computing Guilin University of Electronic Technology Guilin 541004 China

Previous works employ the pivot language approach to conduct statistical machine translation when encountering with limited amount of bilingual corpus. Conventional solutions based upon phrase-table combination overlook the semantic discrepancy between the source-pivot corpus and pivot-target corpus and consequently lead to probability estimation inaccuracy for the induced translation rules. In this paper, the latent topic structure of the document-level training data is learned automatically and each phrase translation rule is assigned to a topic distribution. Furthermore, the phrase probability induction is carried out on the basis of the topic similarity, allowing the translation system to consider the semantic relatedness among different rules. Using BLEU as a metric of translation accuracy, we find out our system is capable of achieving a absolute improvement in in-domain test compared with the baseline system. © 2013 Binary Information Press.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Multi-Consensus Decentralized Accelerated Gradient Descent

arXiv

引用

arXiv 2020年

作者： Ye, Haishan Luo, Luo Zhou, Ziang Zhang, Tong Center for Intelligent Decision-Making and Machine Learning School of Management Xi'an Jiaotong University Xi’an China School of Data Science Fudan University Shanghai China Department of Computing The Hong Kong Polytechnic University Hong Kong Computer Science & Mathematics The Hong Kong University of Science and Technology Hong Kong

This paper considers the decentralized convex optimization problem, which has a wide range of applications in large-scale machine learning, sensor networks, and control theory. We propose novel algorithms that achieve optimal computation complexity and near optimal communication complexity. Our theoretical results give affirmative answers to the open problem on whether there exists an algorithm that can achieve a communication complexity (nearly) matching the lower bound depending on the global condition number instead of the local one. Furthermore, the linear convergence of our algorithms only depends on the strong convexity of global objective and it does not require the local functions to be convex. The design of our methods relies on a novel integration of well-known techniques including Nesterov's acceleration, multi-consensus and gradient-tracking. Empirical studies show the outperformance of our methods for machine learning applications. Copyright © 2020, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Multi-scale cyclical similarity prototype refinement for few-shot breast ultrasound image segmentation

Multi-scale cyclical similarity prototype refinement for few...

引用

International Conference on Signal Processing Proceedings (ICSP)

作者： Yingfeng Ou Xing Yang Jian Zhang Caiqing Jian Lihui Wang Engineering Research Center of Text Computing Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China

ISBN: (数字)9798350387384

ISBN: (纸本)9798350387391

Few-shot learning based methods can address the reliance on large-scale labeled samples in current breast tumor segmentation. However, previous methods typically rely on a few support samples to extract abstract, coarse-grained semantic prototypes, without considering the interaction between support and query data. In this study, we aim to provide each query image with relevant and information-rich support information. By integrating the difficult point selection module and the multi-scale cyclical prototype refinement module, we progressively refine coarse-grained support prototypes into more informative, fine-grained class prototypes, thereby better matching the highly variable breast ultrasound query data. Experiments on two datasets demonstrate that our proposed multi-scale cyclical similarity prototype refinement network (CSPRNet) achieves remarkable improvements compared to previous state-of-the-art methods. Specifically, using ResNet50 as the backbone, we achieve 57.93%/57.92% and 57.58%/59.24% mIoU for 1-shot and 5-shot segmentation, respectively, on public and private datasets, outperforming the suboptimal method by 8.18%/2.55% and 2.77%/4.48%.

关键词： Image segmentation Ultrasonic imaging Breast tumors Semantics Prototypes Signal processing data mining Few shot learning Residual neural networks

来源：评论

学校读者我要写书评

暂无评论

Quantum Fourier Transform of Atrial Fibrillation

Quantum Fourier Transform of Atrial Fibrillation

引用

Quantum computing and Engineering (QCE), IEEE International Conference on

作者： Yu-Ching Chen Chih-Yu Chen Tsung-Wei Huang Chia-Ho Ou Master Program in Intelligent Computing and Big Data Chung Yuan Christian University Taoyuan Taiwan Quantum Information Center Chung Yuan Christian University Taoyuan Taiwan Department of Computer Science and Information Engineering National Pingtung University Pingtung Taiwan

ISBN: (数字)9798331541378

ISBN: (纸本)9798331541385

Electrocardiograms (ECGs) are crucial for detecting cardiac diseases like atrial fibrillation (AF). Traditional analysis methods like fast Fourier transform (FFT) face challenges with increasing data complexity. This study uses Taipei Veterans General Hospital data to explore quantum Fourier transform (QFT) for ECG analysis. Results show that QFT effectively analyzes ECG signals, matching FFT performance while benefiting from quantum computing's efficiency.

关键词： Heart Quantum computing Fast Fourier transforms Hospitals High performance computing Atrial fibrillation Machine learning Electrocardiography Real-time systems Signal analysis

来源：评论

学校读者我要写书评

暂无评论

A data-Driven Approach Towards Software Regression Testing Quality Optimization 25

A Data-Driven Approach Towards Software Regression Testing Q...

引用

25th International Arab Conference on Information Technology, ACIT 2024

作者： Moubayed, Abdallah Alhindawi, Nouh Alsakran, Jamal Injadat, MohammadNoor Kanan, Mohammad King Fahd University of Petroleum & Minerals Computer Engineering Department Interdisciplinary Research Center for Intelligent Secure Systems Dhahran Saudi Arabia Arizona State University School of Computing and Augmented Intelligence GilbertAZ United States Jadara University Department of Software Engineering Irbid Jordan Fairleigh Dickinson University Canada Zarqa University Data Science & Artificial Intelligence Department Zarqa Jordan University of Business and Technology Department of Industrial Engineering Jeddah Saudi Arabia

ISBN: (纸本)9798331540012

Software testing is very important in software development to ensure its quality and reliability. As software systems have become more complex, the number of test cases has increased, which presents the challenge of executing all the tests in a limited time frame. Various test case prioritization techniques have been introduced to solve this problem. These methods aim to identify and implement the most critical tests first. In this paper, we propose an implementation of a dynamic test case prioritization strategy to improve software quality by increasing code coverage with special attention to edge case handling. Edge case test prioritization is a technique that improves test efficiency by selecting extreme case scenarios that can reveal critical bugs or unexpected behavior early in development, improving overall software reliability and dependability. In order to prioritize test cases, this paper presents a regression-based method that makes use of machine learning algorithms. The approach leverages previous performance data to optimize regression testing efficiency by examining variables like test time and execution status. Performance evaluations, when compared against industry standards and cutting-edge techniques, show how effective these algorithms are at correctly prioritizing test cases and identifying faults. This study offers simplified yet reliable solutions for regression testing optimization by shedding light on the efficacy of regression algorithms, such as Random Forest and decision trees. © 2024 IEEE.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

Environment-Aware Dynamic Graph Learning for Out-of-Distribution Generalization

arXiv

引用

arXiv 2023年

作者： Yuan, Haonan Sun, Qingyun Fu, Xingcheng Zhang, Ziwei Ji, Cheng Peng, Hao Li, Jianxin Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University China School of Computer Science and Engineering Beihang University China Key Lab of Education Blockchain and Intelligent Technology Guangxi Normal University China Department of Computer Science and Technology Tsinghua University China

Dynamic graph neural networks (DGNNs) are increasingly pervasive in exploiting spatio-temporal patterns on dynamic graphs. However, existing works fail to generalize under distribution shifts, which are common in real-world scenarios. As the generation of dynamic graphs is heavily influenced by latent environments, investigating their impacts on the out-of-distribution (OOD) generalization is critical. However, it remains unexplored with the following two major challenges: (1) How to properly model and infer the complex environments on dynamic graphs with distribution shifts? (2) How to discover invariant patterns given inferred spatio-temporal environments? To solve these challenges, we propose a novel Environment-Aware dynamic Graph LEarning (EAGLE) framework for OOD generalization by modeling complex coupled environments and exploiting spatiotemporal invariant patterns. Specifically, we first design the environment-aware EA-DGNN to model environments by multi-channel environments disentangling. Then, we propose an environment instantiation mechanism for environment diversification with inferred distributions. Finally, we discriminate spatio-temporal invariant patterns for out-of-distribution prediction by the invariant pattern recognition mechanism and perform fine-grained causal interventions node-wisely with a mixture of instantiated environment samples. Experiments on real-world and synthetic dynamic graph datasets demonstrate the superiority of our method against state-of-the-art baselines under distribution shifts. To the best of our knowledge, we are the first to study OOD generalization on dynamic graphs from the environment learning perspective. Copyright © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Sledge: Towards Efficient Live Migration of Docker Containers

Sledge: Towards Efficient Live Migration of Docker Container...

引用

IEEE International Conference on Cloud computing, CLOUD

作者： Bo Xu Song Wu Jiang Xiao Hai Jin Yingxi Zhang Guoqiang Shi Tingyu Lin Jia Rao Li Yi Jizhong Jiang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China State Key Laboratory of Intelligent Manufacturing System Technology Beijing China The University of Texas at Arlington Arlington TX USA Alibaba Cloud Computing Co. Ltd. Hangzhou China

ISBN: (数字)9781728187808

ISBN: (纸本)9781728187815

Modern large-scale cloud platforms require live migration technique on Docker containers with stateful workload to support load balancing, host maintenance, and Quality of Service (QoS) improvement. Efficient and scalable Docker live migration is expected to guarantee the component-integrity (image, runtime, and management context) with negligible downtime. In this paper, we present a highly efficient live migration system called Sledge, which ensures the component-integrity by integrating both images and management context during runtime migration. The key insight is that the layered image can be leveraged to reduce the migration overhead, and appropriately selective migration of management context will effectively improve QoS with negligible downtime. To achieve good scalability, a lightweight container registry mechanism for end-to-end image migration is designed to avoid the redundant layers transmission. In addition, a dynamic context loading scheme is proposed to precisely load the management context into the running daemon, which can significantly reduce downtime. Experiments show that, compared with the state-of-the-art, Sledge reduces 57% of total migration time, 55% of image migration time, and 70% downtime.

关键词： Cloud computing Runtime Scalability Loading Quality of service Containers Maintenance engineering

来源：评论

学校读者我要写书评

暂无评论

A Deep Look into Neural Ranking Models for Information Retrieval

arXiv

引用

arXiv 2019年

作者： Guo, Jiafeng Fan, Yixing Pang, Liang Yang, Liu Ai, Qingyao Zamani, Hamed Wu, Chen Croft, W. Bruce Cheng, Xueqi University of Chinese Academy of Sciences Beijing China Cas Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China Center for Intelligent Information Retrieval University of Massachusetts Amherst AmherstMA United States

Ranking models lie at the heart of research on information retrieval (IR). During the past decades, different techniques have been proposed for constructing ranking models, from traditional heuristic methods, probabilistic methods, to modern machine learning methods. Recently, with the advance of deep learning technology, we have witnessed a growing body of work in applying shallow or deep neural networks to the ranking problem in IR, referred to as neural ranking models in this paper. The power of neural ranking models lies in the ability to learn from the raw text inputs for the ranking problem to avoid many limitations of hand-crafted features. Neural networks have sufficient capacity to model complicated tasks, which is needed to handle the complexity of relevance estimation in ranking. Since there have been a large variety of neural ranking models proposed, we believe it is the right time to summarize the current status, learn from existing methodologies, and gain some insights for future development. In contrast to existing reviews, in this survey, we will take a deep look into the neural ranking models from different dimensions to analyze their underlying assumptions, major design principles, and learning strategies. We compare these models through benchmark tasks to obtain a comprehensive empirical understanding of the existing techniques. We will also discuss what is missing in the current literature and what are the promising and desired future directions. Copyright © 2019, The Authors. All rights reserved.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

SoLar: sinkhorn label refinery for imbalanced partial-label learning 22

SoLar: sinkhorn label refinery for imbalanced partial-label ...

引用

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

作者： Haobo Wang Mingxuan Xia Yixuan Li Yuren Mao Lei Feng Gang Chen Junbo Zhao Key Lab of Intelligent Computing based Big Data of Zhejiang Province Zhejiang University School of Software Technology Zhejiang University Department of Computer Sciences University of Wisconsin-Madison College of Computer Science Chongqing University and Center for Advanced Intelligence Project RIKEN

ISBN: (纸本)9781713871088

Partial-label learning (PLL) is a peculiar weakly-supervised learning task where the training samples are generally associated with a set of candidate labels instead of single ground truth. While a variety of label disambiguation methods have been proposed in this domain, they normally assume a class-balanced scenario that may not hold in many real-world applications. Empirically, we observe degenerated performance of the prior methods when facing the combinatorial challenge from the long-tailed distribution and partial-labeling. In this work, we first identify the major reasons that the prior work failed. We subsequently propose SoLar, a novel Optimal Transport-based framework that allows to refine the disambiguated labels towards matching the marginal class prior distribution. SoLar additionally incorporates a new and systematic mechanism for estimating the long-tailed class prior distribution under the PLL setup. Through extensive experiments, SoLar exhibits substantially superior results on standardized benchmarks compared to the previous state-of-the-art PLL methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Predicting CircRNA-Disease Associations Through Non-negative Matrix Factorization and Adversarially Regularized Variational Graph Autoencoder

Predicting CircRNA-Disease Associations Through Non-negative...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Mianshuo Lu Lei Wang Jinzhu Sun Yang Li Mengmeng Wei Yu Wei Changchun Liu Zhengwei Li School of Computer Science and Technology China University of Mining and Technology Xuzhou China Big Data and Intelligent Computing Research Center Guangxi Academy of Sciences Nanning China Zaozhuang Mental Health Center Zaozhuang China School of Computer Science and Information Engineering Hefei University of Technology Hefei China College of Information Science and Enginnering Zaozhuang Univerity China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Circular RNA (circRNA) is an RNA molecule that plays an important role in both pathology and physiology. Accurate identification of associations between circRNAs and diseases is crucial for further physiology research. However, verifying the circRNA-disease associations (CDA) through biological experimental methods is time-consuming. Here, we propose a novel method combines Non-negative Matrix Factorization (NMF) and Adversarially Regularized Variational Graph Autoencoder (ARVGA) to accurately predict CDA. Our model first fuses multi-source information in order to build circRNA similarity, disease similarity and circRNA-disease association matrices. Thereby our model constructs graphs for circRNA and disease respectively and optimize them using a K-means clustering algorithm. We obtain linear features using NMF and non-linear features using ARVGA. Finally, an Extremely Randomized Trees classifier is employed to predict CDA. On the gold standard dataset CircR2Disease, our model achieved a prediction accuracy of 94.8% and an AUC of 0.984 under 5-fold cross-validation. In case study, 19 of top 20 predicted circRNAs associated with Hepatocellular Carcinoma were confirmed in relevant literature. Furthermore, ablation experiment, classifier experiment and independent datasets test fully demonstrate the effectiveness and robustness of our model.

关键词： Biological system modeling RNA Autoencoders Clustering algorithms Predictive models Feature extraction Prediction algorithms Robustness Physiology Diseases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：