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

2017 IEEE 2nd International Conference on Big Data Analysis（ICBDA 2017）

作者： Hui Zhang Min Wang Jiangsu Key Lab of Wireless Communications Nanjing University of Posts and Telecommunications Provincial Key Laboratory for Computer Information Processing Technology Soochow University

ISBN: (纸本)9781509036202

First,according to characteristics of mobile social environment,by using optimization models based on similarity degree and interaction degree respectively,the optimal correlated users can be selected for analyzing two main factors of a target user's behaviors(***-term habits and shortterm influences);furthermore,an adaptive update strategy based on fuzzy theory is proposed to describe the importance of two factors in real time and quantitative ***,an improved Apriori theory is introduced to predict user service behaviors accurately;particularly,a new update mechanism for Apriori sample database is built to effectively integrate the samples of optimal correlated ***,simulation results verify the effectiveness of proposed algorithm.

关键词： mobile social environment user behavior prediction fuzzy theory adaptive update strategy improved Apriori theory

来源：评论

学校读者我要写书评

暂无评论

Neural Network-Assisted Hybrid Model Based Message Passing for Parametric Holographic MIMO Near Field Channel Estimation

引用

IEEE Transactions on Wireless Communications 2025年

作者： Yuan, Zhengdao Guo, Yabo Gao, Dawei Guo, Qinghua Wang, Zhongyong Huang, Chongwen Jin, Ming Wong, Kai-Kit Henan Open University Artificial Intelligence Technology Engineering Research Center Zhengzhou450002 China University of Wollongong School of Electrical Computer and Telecommunications Engineering WollongongNSW2522 Australia Zhengzhou University School of Information Engineering Zhengzhou450002 China Xidian University Hangzhou Institute of Technology Hangzhou311200 China University of Wollongong School of Electrical Computer and Telecommunications Engineering NSW2522 Australia Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China Zhejiang Provincial Key Laboratory of Multi-Modal Communication Networks and Intelligent Information Processing Hangzhou310027 China Ningbo University Faculty of Electrical Engineering and Computer Science Ningbo315211 China University College London Department of Electronic and Electrical Engineering Torrington Place WC1E 7JE United Kingdom Yonsei University Yonsei Frontier Lab Seoul Korea Republic of

Holographic multiple-input and multiple-output (HMIMO) is a promising technology with the potential to achieve high energy and spectral efficiencies, enhance system capacity and diversity, etc. In this work, we address the challenge of HMIMO near field (NF) channel estimation, which is complicated by the intricate model introduced by the dyadic Green's function. Despite its complexity, the channel model is governed by a limited set of parameters. This makes parametric channel estimation highly attractive, offering substantial performance enhancements and enabling the extraction of valuable sensing parameters, such as user locations, which are particularly beneficial in mobile networks. However, the relationship between these parameters and channel gains is nonlinear and compounded by integration, making the estimation a formidable task. To tackle this problem, we propose a novel neural network (NN) assisted hybrid method. With the assistance of NNs, we first develop a novel hybrid channel model with a significantly simplified expression compared to the original one, thereby enabling parametric channel estimation. Using the readily available training data derived from the original channel model, the NNs in the hybrid channel model can be effectively trained offline. Then, building upon this hybrid channel model, we formulate the parametric channel estimation problem with a probabilistic framework and design a factor graph representation for Bayesian estimation. Leveraging the factor graph representation and unitary approximate message passing (UAMP), we develop an effective message passing-based Bayesian channel estimation algorithm. Extensive simulations demonstrate the superior performance of the proposed method. © 2025 IEEE.

关键词： Green's function

来源：评论

学校读者我要写书评

暂无评论

A parallel ACO approach based on one pheromone matrix

引用

Ant Colony Optimization and Swarm Intelligence - 5th International Workshop, ANTS 2006, Proceedings

作者： Qiang, Lv Xiaoyan, Xia Peide, Qian School of Computer Science and Technology Soochow Univeristy China Jiangsu Provincial Key Lab. of Computer Information Processing Technology Suzhou China

ISBN: (纸本)3540384820

This paper presents and implements an approach to parallel ACO algorithms. The principal idea is to make multiple ant colonies share and utilize only one pheromone matrix. We call it SHOP (SHaring One Pheromone matrix) approach. We apply this idea to the two currently best instances of ACO sequential algorithms (MMAS and ACS), and try to hybridize these two different ACO instances. We mainly describe how to design parallel ACS and MMAS based on SHOP. We present our computing results of applying our approach to solving 10 symmetric traveling salesman problems, and give comparisons with the relevant sequential versions under the fair computing environment. The experimental results indicate that SHOP-ACO algorithms perform overall better than the sequential ACO algorithms in both the computation time and solution quality. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Context-Sensitive Convolution Tree Kernel for Pronoun Resolution 3

Context-Sensitive Convolution Tree Kernel for Pronoun Resolu...

引用

3rd International Joint Conference on Natural Language processing, IJCNLP 2008

作者： Zhou, GuoDong Kong, Fang Zhu, Qiaoming JiangSu Provincial Key Lab for Computer Information Processing Technology School of Computer Science and Technology Soochow Univ. Suzhou215006 China

This paper proposes a context-sensitive convolution tree kernel for pronoun resolution. It resolves two critical problems in previous researches in two ways. First, given a parse tree and a pair of an anaphor and an antecedent candidate, it implements a dynamic-expansion scheme to automatically determine a proper tree span for pronoun resolution by taking predicate- and antecedent competitor-related information into consideration. Second, it applies a context-sensitive convolution tree kernel, which enumerates both context-free and context-sensitive sub-trees by considering their ancestor node paths as their contexts. Evaluation on the ACE 2003 corpus shows that our dynamic-expansion tree span scheme can well cover necessary structured information in the parse tree for pronoun resolution and the context- sensitive tree kernel much outperforms previous tree kernels. © 2008 IJCNLP 2008 - 3rd International Joint Conference on Natural Language processing, Proceedings of the Conference. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Topic-driven multi-document summarization

Topic-driven multi-document summarization

引用

International Conference on Asian Language processing

作者： Wang, Hongling Zhou, Guodong Jiangsu Provincial Key Lab. for Computer Information Processing Technology School of Computer Science and Technology Soochow University Suzhou 215006 China

ISBN: (纸本)9780769542881

This paper presents a topic-driven framework for generating a generic summary from multi-documents. Our approach is based on the intuition that, from the statistical point of view, the summary's probability distribution over the topics should be consistent with the multi-documents'probability distribution over the inherent topics. Here, the topics are defined as weighted "bag-of-words" and derived by Latent Dirichlet Allocation from a collection of documents, either the given multi-documents or a related large-scale corpus. In this sense, we could represent various kinds of text units, such as word, sentence, summary, document and multi-documents, using a single vector space model via their corresponding probability distributions over the derived topics. Therefore, we are able to extract a sentence or summary by calculating the similarity between a sentence/summary and the given multi-documents via their topic probability distributions. In particular, we propose two methods in similarity measurement: the static method and the dynamic method. While the former is employed to detect the salience of information in a static way, the later further controls redundancy in a dynamic way. In addition, we integrate various popular features to improve the performance. Evaluation on the TAC 2008 update summarization task shows encouraging results. © 2010 IEEE.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Global learning of noun phrase anaphoricity in coreference resolution via label propagation

Global learning of noun phrase anaphoricity in coreference r...

引用

2009 Conference on Empirical Methods in Natural Language processing, EMNLP 2009, Held in Conjunction with ACL-IJCNLP 2009

作者： Zhou, Guo Dong Kong, Fang JiangSu Provincial Key Lab. for Computer Information Processing Technology School of Computer Science and Technology Soochow University Suzhou 215006 China

Knowledge of noun phrase anaphoricity might be profitably exploited in coreference resolution to bypass the resolution of non-anaphoric noun phrases. However, it is surprising to notice that recent attempts to incorporate automatically acquired anaphoricity information into coreference resolution have been somewhat disappointing. This paper employs a global learning method in determining the anaphoricity of noun phrases via a label propagation algorithm to improve learning-based coreference resolution. In particular, two kinds of kernels, i.e. the feature-based RBF kernel and the convolution tree kernel, are employed to compute the anaphoricity similarity between two noun phrases. Experiments on the ACE 2003 corpus demonstrate the effectiveness of our method in anaphoricity determination of noun phrases and its application in learning-based coreference resolution. © 2009 ACL and AFNLP.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Semi-Supervised Learning for Relation Extraction 3

Semi-Supervised Learning for Relation Extraction

引用

3rd International Joint Conference on Natural Language processing, IJCNLP 2008

作者： Zhou, Guo Dong Li, Jun Hui Qian, Long Hua Zhu, Qiaoming Jiangsu Provincial Key Lab for Computer Information Processing Technology School of Computer Science and Technology Soochow Univ. Suzhou215006 China

This paper proposes a semi-supervised learning method for relation extraction. Given a small amount of labeled data and a large amount of unlabeled data, it first bootstraps a moderate number of weighted support vectors via SVM through a co-training procedure with random feature projection and then applies a label propagation (LP) algorithm via the bootstrapped support vectors. Evaluation on the ACE RDC 2003 corpus shows that our method outperforms the normal LP algorithm via all the available labeled data without SVM bootstrapping. Moreover, our method can largely reduce the computational burden. This suggests that our proposed method can integrate the advantages of both SVM bootstrapping and label propagation.s. © 2008 IJCNLP 2008 - 3rd International Joint Conference on Natural Language processing, Proceedings of the Conference. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Employing the centering theory in pronoun resolution from the semantic perspective

Employing the centering theory in pronoun resolution from th...

引用

2009 Conference on Empirical Methods in Natural Language processing, EMNLP 2009, Held in Conjunction with ACL-IJCNLP 2009

作者： Kong, Fang Zhou, Guo Dong Zhu, Qiaoming JiangSu Provincial Key Lab. for Computer Information Processing Technology School of Computer Science and Technology Soochow University Suzhou 215006 China

In this paper, we employ the centering theory in pronoun resolution from the semantic perspective. First, diverse semantic role features with regard to different predicates in a sentence are explored. Moreover, given a pronominal anaphor, its relative ranking among all the pronouns in a sentence, according to relevant semantic role information and its surface position, is incorporated. In particular, the use of both the semantic role features and the relative pronominal ranking feature in pronoun resolution is guided by extending the centering theory from the grammatical level to the semantic level in tracking the local discourse focus. Finally, detailed pronominal subcategory features are incorporated to enhance the discriminative power of both the semantic role features and the relative pronominal ranking feature. Experimental results on the ACE 2003 corpus show that the centering-motivated features contribute much to pronoun resolution. © 2009 ACL and AFNLP.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Joint high-resolution feature learning and vessel-shape aware convolutions for efficient vessel segmentation

引用

computers in Biology and Medicine 2025年 191卷 109982-109982页

作者： Zhang, Xiang Zhu, Qiang Hu, Tao Guo, Song Bian, Genqing Dong, Wei Hong, Rao Lin, Xia Ling Wu, Peng Zhou, Meili Yan, Qingsen Mohi-ud-din, Ghulam Ai, Chen Li, Zhou College of Information and Control Engineering Xi'an University of Architecture and Technology Xi'an China Shaanxi Provincial Key Lab of Bigdata of Energy and Intelligence Processing School of Physics and Electronic Information Yanan University Yanan China School of Computer Science and Engineering Northwestern Polytechnical University Xi'an China School of Software Nanchang University Nanchang China School of Cyber Security Zhejiang University Hangzhou China Department of Basic Education and Research Jiangxi Police College Nanchang China Northwestern Polytechnical University China

Clear imagery of retinal vessels is one of the critical shreds of evidence in specific disease diagnosis and evaluation, including sophisticated hierarchical topology and plentiful-and-intensive capillaries. In this work, we propose a new topology- and shape-aware model named Multi-branch Vessel-shaped Convolution Network (MVCN) to adaptively learn high-resolution representations from retinal vessel imagery and thereby capture high-quality topology and shape information thereon. Two steps are involved in our pipeline. The former step is proposed as Multiple High-resolution Ensemble Module (MHEM) to enhance high-resolution characteristics of retinal vessel imagery via fusing scale-invariant hierarchical topology thereof. The latter is a novel vessel-shaped convolution that captures the retinal vessel topology to emerge from unrelated fundus structures. Moreover, our MVCN of separating such topology from the fundus is a dynamical multiple sub-label generation via using epistemic uncertainty, instead of manually separating raw labels to distinguish definitive and uncertain vessels. Compared to other existing methods, our method achieves the most advanced AUC values of 98.31%, 98.80%, 98.83%, and 98.65%, and the most advanced ACC of 95.83%, 96.82%, 97.09%,and 96.66% in DRIVE, CHASE_DB1, STARE, and HRF datasets. We also employ correctness, completeness, and quality metrics to evaluate skeletal similarity. Our method's evaluation metrics have doubled compared to previous methods, thereby demonstrating the effectiveness thereof. © 2025 Elsevier Ltd

关键词： Ophthalmology

来源：评论

学校读者我要写书评

暂无评论

Towards termination criteria of ant colony optimization

Towards termination criteria of ant colony optimization

引用

3rd International Conference on Natural Computation, ICNC 2007

作者： Lv, Qiang Xia, Oyan School of Computer Science and Technology Suzhou University Suzhou Jiangsu 215006 China Provincial Key Lab. for Computer Information Processing Technology Suzhou Jiangsu 215006 China

ISBN: (纸本)0769528759

Ant colony optimization (ACO for short) has been proved a successful meta-heuristic by a huge of empirical studies. This paper discusses the termination criteria of ACO and therefore provides research ideas to other meta-heuristics. A general discussion about four types of termination criteria has been firstly discussed in this article. Then some measures of convergence based on pheromone have been introduced. And a new termination criterion based on Bayesian approach is presented. Finally a new convergence proof for a class of ACO algorithms is presented. © 2007 IEEE.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：