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

International Conference on Mechatronics Engineering and Computing Technology (ICMECT)

作者： Xiao, Bing GuangDong Polytech Normal Univ Sch Comp Sci Guangzhou 510665 Guangdong Peoples R China

ISBN: (纸本)9783038351153

Through digging out the core suppliers and core customers from the numerous suppliers and customers in the complex network of E-commerce, it contributes to reducing the adverse selection for the consumers and moral hazards for the operators caused by information asymmetry. Meanwhile, it is very meaningful for the credit risk protection in the complex network of E-commerce. On the basis of the references to the White and Smyth algorithms, in this paper, improvements from the White and Smyth algorithms are made herein, combining several features of the E-commerce complex network such as competitiveness, incomplete information and unsymmetrical information. In addition, an algorithm for mining the key nodes in E-commerce complex network is put forward, and applications are explained by instances.

关键词： E-commerce complex network core node mining algorithm

来源：评论

学校读者我要写书评

暂无评论

Study on microblog public opinion data mining algorithm based on multi-visual clustering model

引用

INTERNATIONAL JOURNAL OF AUTONOMOUS AND ADAPTIVE COMMUNICATIONS SYSTEMS 2020年第2期13卷 151-165页

作者： Li, Lin-lin Hou, Wei-zhen Liu, Jing Renmin Univ China Sch Informat Resources Management Beijing 100872 Peoples R China Minist Transport Informat Inst Transport Planning & Res Inst Beijing 100028 Peoples R China

Because of the random distribution of microblog public opinion data, it is difficult to mine, this paper proposes a microblog public opinion data mining algorithm based on multi vision clustering model. It constructs the phase space distribution structure model of microblog public opinion data, the fuzzy association rule distribution set of microblog public opinion data, analyses the high-order statistical characteristics of microblog public opinion data, and advances the data of fuzzy clustering center according to the different statistical characteristics Row partition block scheduling. The binary structure of microblog public opinion data is reconstructed in the virtual database, and multi angle fuzzy clustering is carried out according to the reconstruction results to realise the optimised mining of microblog public opinion data. The simulation results show that the mining time of this method is up to 4.13 MS and the mining accuracy is up to 100%.

关键词： multi-visual clustering microblog public opinion data mining algorithm simulation

来源：评论

学校读者我要写书评

暂无评论

Fast association rule mining algorithm for network attack data

引用

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY 2017年第6-7期20卷 1465-1469页

作者： Song, Junhui Xie, Hua Feng, Yan Xinyang Normal Univ Coll Comp & Informat Technol Xinyang 464000 Peoples R China Xinyang Vocat & Tech Coll Coll Check Technol Xinyang 464000 Peoples R China

Current risk data generated by network attack data is lack of predictability, in this paper, a fast association rule mining algorithm for network attack data is proposed. Based on the related data, the fuzzy theory is used to introduce the frequency of network attack events into the association rules, and based on the genetic algorithm, the concept of interest degree and approximation are introduced to improve the membership function which can establish the network attack data association rules to achieve rapid data mining. The experimental results showed that the proposed algorithm has certain accuracy and efficiency advantages.

关键词： Network attack data Association rules mining algorithm Fuzzy theory

来源：评论

学校读者我要写书评

暂无评论

Research Of A mining algorithm Based On Markov Chain On WEB Page Access Sequence Features

Research Of A Mining Algorithm Based On Markov Chain On WEB ...

引用

International Conference on Information Technology and Applications (ITA)

作者： Liu, Gang Guo, Han Jilin Inst Architecture & Engn Changchun Peoples R China Changchun Univ Technol Changchun Peoples R China

ISBN: (纸本)9781479928767

Web access to sequence data mining to help improve the quality of Web access, the sequence is a difficult problem in data mining, the prevalence of classic sequential algorithm and storage space overhead is too large defects. Web access sequence mining algorithm based on Markov chain can be found through less computation requests a web page. And for the design of the site, and achieved good results. Recognize that the most likely path through the site through the Web click-stream in order to predict the users will want to browse web pages, and accordingly to improve the design and construction of the site. Less computation to find the requested page, optimization of the hyperlink structure of the Web site.

关键词： Markov Chain mining algorithm WEB Transfer Matrix

来源：评论

学校读者我要写书评

暂无评论

Feedback System Design of Architectural Planning Based on Diversified Hot mining algorithm

Feedback System Design of Architectural Planning Based on Di...

引用

International Conference on Advances in Materials Science and Information Technologies in Industry (AMSITI)

作者： Lv, Haijing Han, Zhenkun Northeast Agr Univ Sch Art Harbin 150031 Peoples R China Harbin Inst Technol Sch Architecture Harbin 150001 Peoples R China

ISBN: (纸本)9783038350125

Under the background of information era, we use WEB2.0, which has rich feedback system of users, to analyze the diversification of information transfer mode. It will make the performance results of the system more intelligent and systematization. Therefore, we use the manifestation of architecture planning art as an example, in the WEB2.0 environment, presents a multi hot spot mining algorithm, to analyze the diversification and individuation. We use the established transferring model to do data modeling. Then extracting and evaluating the content of text. The experimental results show that the data hot mining algorithm based on diversification can use the feedback information of users effectively, adapting to the WEB2.0 environment. Therefore, in the spreading development of internet information today, based on the internet resources, this paper presents a new algorithm to analyze diversification and individuation manifestation of architecture planning art. It provides a technical innovation and theoretical reference.

关键词： Internet Architecture planning Diversification WEB service mining algorithm

来源：评论

学校读者我要写书评

暂无评论

Network Topology Constraint Based Transaction Separation and mining algorithm of Telecom Alarm

Network Topology Constraint Based Transaction Separation and...

引用

International Symposium on Knowledge Acquisition and Modeling

作者： Chen, Jun Zhang, Bin Li, Guohui Beijing Univ Posts & Telecommun Pattern Recognit & Intelligent Syst Lab Beijing 100088 Peoples R China

ISBN: (纸本)9781424435296

The efficiency of alarm mining in large scale network is a hot topic in research area of fault location. Many projects have been utilized to improve it and some advance has been achieved, but it is still not very satisfied. Large scale telecom system daily generates large numbers of original alarm records and many of them are redundant information, actually useful information for fault location is only a small part. So in order to increase efficiency of alarm mining, we propose a solution called network topology constraint based transaction separation in this paper and we also compare it with the method of adding topology constraint into mining algorithms. The experiments show that separating transaction with network topology constraint deletes a huge number of redundant alarm information and incorrect transaction sets before executing mining algorithms, therefore, it is can be more efficient and precise than topology constraint based mining algorithm, which filters erroneous frequent sub-patterns during algorithm execution.

关键词： network topology constraint alarm mining transaction separation telecom alarm mining algorithm

来源：评论

学校读者我要写书评

暂无评论

Tacit knowledge mining algorithm based on linguistic truth-valued concept lattice 10

Tacit knowledge mining algorithm based on linguistic truth-v...

引用

10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)

作者： Yang, Li Wang, Yuhui Xu, Yang North China Univ Water Resources & Elect Power Sch Math & Informat Sci Zhengzhou 450046 Peoples R China Henan Agr Univ Coll Mech & Elect Engn Zhengzhou 450002 Peoples R China Southwest Jiaotong Univ Intelligent Control Dev Ctr Chengdu 610031 Peoples R China

ISBN: (纸本)9781467393232

Natural language processing is one of the important research in the field of artificial intelligence, and tacit knowledge expressed by natural language is the research hotspot. In order to provide a mathematical tool for mining tacit knowledge, we establish a concrete model of 6-ary linguistic truth-valued concept lattice to deal with natural language and introduce a mining algorithm of tacit knowledge through the structure consistency. Specifically, we utilize the attributes to depict knowledge, propose the 6-ary linguistic truth-valued object tacit context and homotype context to characterize tacit knowledge, and research the necessary and sufficient conditions of forming tacit knowledge. We respectively give the generating algorithm of the linguistic truth-valued homotype context and the constructing algorithm the 6-ary linguistic truth-valued concept lattice.

关键词： artificial intelligence concept lattice tacit knowledge linguistic truth-valued concept lattice mining algorithm

来源：评论

学校读者我要写书评

暂无评论

A mining algorithm for fuzzy weighted association rules

A mining algorithm for fuzzy weighted association rules

引用

International Conference on Machine Learning and Cybernetics

作者： Wang, BY Zhang, SM N China Elect Power Univ Dept Comp Sci & Engn Baoding 071003 Hebei Peoples R China

ISBN: (纸本)0780378652

The association rule mining is an important research subject of knowledge discovery. Aiming at the common method of mining for attributes of quantitative type in database, we analyze the existing defects and put forward a method of applying fuzzy set theory to association rules mining. Due to the problem that each attribute's importance is different in specific purpose mining, we put forward a solution by assigning corresponding weight to attribute of different importance. Basing on the above idea, we put forward a mining algorithm using fuzzy weighted association rules and through the given experiment we testify the feasibility of the algorithm. and point out the existing defect of the algorithm demanding improvement in future.

关键词： fuzzy weighted association rules fuzzy set mining algorithm frequent pattern quantitative attribute database

来源：评论

学校读者我要写书评

暂无评论

Research of Commonly Used Association Rules mining algorithm in Data mining

Research of Commonly Used Association Rules Mining Algorithm...

引用

2011 International Conference on Internet Computing and Information Services （ICICIS 2011）

作者： Ruowu Zhong Huiping Wang Institute of Computer Shaoguan University

This paper introduces the concept of data mining and its an important branch- association rules, describes the basic concept of association rules, the basic model of mining association rules;introduces the classical algorithm of association rules, and then classified discusses the association rules mining from several angles such as width, depth, partition, sampling and incremental updating. Finally, this paper prospects the association rules mining.

关键词： data mining association rules frequent itemsets mining algorithm

来源：评论

学校读者我要写书评

暂无评论

FT＿HTlist: A fault-tolerant frequent itemset mining algorithm based on the linear table

FT＿HTlist: A fault-tolerant frequent itemset mining algorit...

引用

作者： Xingyue Li Jun Lu School of Computer Science and Technology Heilongjiang University

This paper proposes a fault-tolerant frequent itemset mining algorithm（FTTlist）based on the linear table when the fault-tolerance is 1. The algorithm uses the method of concatenating 1 in the highest bit of the binary number of the known fault-tolerant frequent patterns to generate the candidate fault_tolerant patterns, called FTandidate. The algorithm is based on the data structure of the linear table for fault-tolerant frequent itemset mining. This method does not need recursion, so it reduces the consumption of mining space. At the same time, the paper proposed a deduplication algorithm to remove the support for repeat calculations. So the algorithm has a strong advantage in spatial performance. In addition, the algorithm only needs to mine two horizontal chains of the FTandidate, thus reducing the consumption of mining time. Finally, the paper shows the time performance and space performance of the proposed algorithm under sparse datasets and dense datasets. The results show that our algorithm has better mining time than other algorithms, and the horizontal chain reduces the memory occupation of the algorithm.

关键词： The linear table Fault-tolerance mining algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：