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

A community mining algorithm for web texts based on Multi-agent system

Journal of computational Information Systems 2010年第11期6卷 3509-3516页

作者： Yang, Hui Wang, Zhe Zhou, Xu Zhou, Tong Wang, Zuo College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory for Symbol Computation and Knowledge Engineering Ministry of Education China

Most of the existing methods for community discovery only deal with social network with a fixed structure, so they can not effectively deal with dynamic social network. This paper proposes a Multi-agent system method which is applied to real-time dynamic web texts for community discovery. This method combines the multi-agent system control mechanisms with community discovery algorithm. The approach not only divides community for the published web text, but also changes the community division according to the newly updated contents of web texts. Meanwhile, the similarity of two web texts is evaluated through similarity algorithm which compares content similarity and semantic similarity. The effectiveness of this algorithm has been tested on real web texts networks and experiment 3 illustrated the scalability of our algorithm for dynamic community discovery of web texts. © 2010 Binary Information Press.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Optimization strategy of parallel query processing based on multi-core architecture

引用

Journal of Convergence Information Technology 2010年第8期5卷 24-24页

作者： Chen, Yongheng Zuo, Wanli He, Fengling Chen, Kerui College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun China

Chip Multi-Processor (CMP) could support more than two threads to execute simultaneously, and some executing units are owned by each core. Because threads share various resources of CMP, such as L2-Cache, among many threads, CMP system is inherently different from multiprocessors system and, CMP is also different from simultaneously multithreading (SMT). In this paper a novel and complete approach on how to parallelism for relational database multithreaded query execution that strives for maximum resource utilization for both CPU and disk activities. The focus of this approach is on how to use the multithreaded parallel technique to optimize and process queries based on multi-core architecture. A set of algorithms for implementing and optimizing the best query plan, such as the algorithms for scheduling and parallel executing the query plan, the algorithms for allocating thread to sub-query and memory to the buffers between operations in pipelining execution, are proposed in this method. Additionally this paper analysis and optimize the implementation of parallel buffers and multithread. In the experiments, this paper evaluates performance of the parallel buffers and tests the coordination of the multithread.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Cooperative coevolutionary genetic algorithms to find optimal elimination orderings for Bayesian networks

Cooperative coevolutionary genetic algorithms to find optima...

引用

2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010

作者： Dong, Xuchu Yu, HaiHong Ouyang, Dantong Cai, Dianbo Ye, Yuxin Zhang, Yonggang Department of Computer Science and Technology Jilin University Changchun Jilin China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Changchun Jilin China Network Monitor Maintenance Centre Jilin Branch China Telecom Corporation Limited Changchun Jilin China

ISBN: (纸本)9781424464388

According to the characteristics of the optimal elimination ordering problem in Bayesian networks, a heuristic-based genetic algorithm, a cooperative coevolutionary genetic framework and five grouping schemes are proposed. Based on these works, six cooperative coevolutionary genetic algorithms are constructed. Numerical experiments show that these algorithms are more robust than other existing swarm intelligence methods when solving the elimination ordering problem. © 2010 IEEE.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

A hybrid discrete PSO-SA algorithm to find optimal elimination orderings for Bayesian networks

A hybrid discrete PSO-SA algorithm to find optimal eliminati...

引用

2010 2nd International Conference on Industrial and Information Systems, IIS 2010

作者： Dong, Xuchu Ouyang, Dantong Cai, Dianbo Zhang, Yonggang Ye, Yuxin Department of Computer Science and Technology Jilin University Changchun Jilin China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun Jilin China Network Monitor Maintenance Centre Jilin Branch China Telecom Corporation Limited Changchun Jilin China

ISBN: (纸本)9781424482177

In this paper, a hybrid algorithm named DPSO-SA is proposed to find near-to-optimal elimination orderings in Bayesian networks. DPSO-SA is a discrete particle swarm optimization method enhanced by simulated annealing. computational tests show that this hybrid method is very effective and robust for the elimination ordering problem. © 2010 IEEE.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Soil fertility grading with Bayesian Network transfer learning

Soil fertility grading with Bayesian Network transfer learni...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Hai-Yang Jia Juan Chen He-Long Yu Da-You Liu College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin China College of Information technology Jilin agricultural University Changchun Jilin China

Soil fertility grading is an important issue in the agriculture domain, AI based approach has been applied recently. But in most circumstance data obtaining is a expensive and time consuming procedure, sometimes even impossible. This paper presents a Bayesian Network based transfer learning algorithm. The existing training results can be transferred between the nearby land squares. The proposed algorithm considers both the similarity between the learning task and the geographical position of the land squares. Empirical experiment were implemented to prove the efficiency of the algorithm.

关键词： Bayesian methods Machine learning Learning Soil Random variables Machine learning algorithms Training data

来源：评论

学校读者我要写书评

暂无评论

Analysis the uncertainties of the Ant Colony Algorithm

Analysis the uncertainties of the Ant Colony Algorithm

引用

International Conference on computational Aspects of Social Networks, CASON

作者： Zhang, Yi Zhang, Meng Cao, Xin-Yan Department of Information Engineer Jilin Business and Technology College Changchun 130062 China College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China College of Electronic Information Engineering University of Changchun Changchun Jilin Province 130000 China

ISBN: (纸本)9780769542027

In this paper, the subject of discussion is the uncertainties of Ant Colony Algorithm(ACA). In order to find application and popularize the ACA, we try to find some disciplinarians which can eliminate the impact of uncertainties in our algorithm and find the best assembled of the parameters by a series of experiments. Results show that our works had great effects in practicality. © 2010 IEEE.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Automatic generation of domain-specific ontology from deep web

引用

Journal of Information and computational Science 2010年第2期7卷 519-525页

作者： Chen, Kerui Zuo, Wanli Zhang, Fan He, Fengling Peng, Tao College of Computer Science and Technology Jilin University Changchun 130012 China College of Information Engineering Zhongzhou University Zhengzhou 450044 China Key Laboratory of Computation and Knowledge Engineering Ministry of Education China

In Deep Web, there are various methods of studying extraction of data records. After carefully reviewing and analyzing those methods, we find that the problem of dealing with either zero or fewer query results and nested data structure still exists. By using ontology's cooperation, the problem would be solved easily. We observe that query interfaces and data pages of the sources often contain rich information on concepts, instances, and concept relationships in the application domain. This proposal proposes a method combined query interface and query result, to automatically extract specific domain ontology. In addition, the ontology model, which was designed based on the structured and semi-structured characteristics of deep web, also can assist the process of extracting deep web result pages. Experimental results approve that our method can get more comprehensive concepts, simple domain-specific ontology is more convenient for being applied in data extraction. Copyright © 2010 Binary Information Press.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Semantic Retrieval System Based on Corn Ontology

Semantic Retrieval System Based on Corn Ontology

引用

Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST)

作者： Hong Qi Liangliang Zhang Ying Gao Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China College of Computer Science and Technology Jilin University China Alcatel Lucent Shanghai Bell Company Limited China Jilin University Changchun Jilin CN

Most of the current information retrieval systems are mainly based on full text matching of keywords or topic-based classification, often return a large number of irrelevant information, and are unable to meet the user's request. Ontology-based semantic retrieval is a hot issue in current research. In this paper, the corn plant ontology is constructed using Formal Concept Analysis based approach in which the concept lattice is built from terminology-file relationship table and further reduced. Based on the corn plant ontology, we propose a semantic annotation method in which the feature words are selected by an improved method for weight calculation and the RDF triples are generated by syntactic parser. Finally a semantic retrieval system for corn plant is developed. In comparative experiment one hundred documents are selected as the dataset, and the result shows that the semantic retrieval system introduced in this paper is superior to keyword-based retrieval method in precision ratio and recall ratio.

关键词： Semantics Ontologies Information retrieval Lattices Feature extraction Resource description framework Optical wavelength conversion

来源：评论

学校读者我要写书评

暂无评论

A Stable Stochastic Optimization Algorithm for Triangulation of Bayesian Networks

A Stable Stochastic Optimization Algorithm for Triangulation...

引用

International Workshop on knowledge Discovery and Data Mining (WKDD)

作者： Xuchu Dong Dantong Ouyang Yuxin Ye Shasha Feng Haihong Yu Department of Computer Science and Technology Jilin University Changchun Jilin China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun Jilin China

ISBN: (纸本)9781424453979

In this paper, we present a novel deterministic heuristic and a new genetic algorithm to solve the problem of optimal triangulation of Bayesian networks. The heuristic, named MinFillWeight, aims to select variables minimizing the multiplication of the weights on nodes of fill-in edges. The genetic algorithm, named GA-MFW, uses a new rank-reserving crossover operator and a 2-fold mutation mechanism utilizing the MinFillWeight heuristic. Experiments on representative benchmark show that the deterministic heuristic and the stochastic algorithm have good performance and stability to various problems.

关键词： Stochastic processes Bayesian methods Tree graphs Ethics Genetic algorithms Inference algorithms Genetic mutations Stability Ant colony optimization Data mining

来源：评论

学校读者我要写书评

暂无评论

A Multi-heuristic Cooperative Ant Colony System for Optimizing Elimination Ordering of Bayesian Networks

A Multi-heuristic Cooperative Ant Colony System for Optimizi...

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： Xuchu Dong Dantong Ouyang Yuxin Ye Haihong Yu Yonggang Zhang Department of Computer Science and Technology Jilin University Changchun Jilin China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun Jilin China

To solve the problem of searching for an optimal elimination ordering of Bayesian networks, a novel effective heuristic, MinSum Weight, and an ACS approach incorporated with multi-heuristic mechanism are proposed. The ACS approach named MHC-ACS utilizes a set of heuristics to direct the ants moving in the search space. The cooperation of multiple heuristics helps ants explore more regions. Moreover, the most appropriate heuristic will be identified and be reinforced with the evolution of the whole system. Experiments demonstrate that MHC-ACS has a better performance than other swarm intelligence methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：