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

3rd Joint International Conference on Semantic Technology

作者： Ichinose, Shiori Kobayashi, Ichiro Iwazume, Michiaki Tanaka, Kouji Ochanomizu Univ Grad Sch Humanities & Sci Tokyo 112 Japan Univ Commun Res Inst NICT Kyoto Japan

ISBN: (纸本)9783319068268;9783319068251

In recent years, a number of Semantic Web databases have been actively open to public as common resources on the Web by the effort of Linked Open Data community project. Due to this, we need a good method to search necessary data from those databases, depending on various purposes. In this study, we propose two methods to rank the results retrieved by a SPARQL query (especially, a SELECT query), using the information about the frequency of each property in a data set and the links between RDF resources. In order to evaluate our proposed methods, we set two cases for using SPARQL queries, and then rank the query results in each case. The usefulness of our proposed method has been confirmed by subject experiments.

关键词： DBpedia SPARQL Ranking pagerank algorithm Semantic Web

来源：评论

学校读者我要写书评

暂无评论

A Word Sense Disambiguation Method Based on Multiple Sense Graph

A Word Sense Disambiguation Method Based on Multiple Sense G...

引用

2024 International Conference on Machine Learning and Intelligent Computing, MLIC 2024

作者： Liu, Wenjun Wang, Hailan Wang, Xiping Hou, Mengshu Chengdu611731 China School of Computer and Software Engineering Xihua University Chengdu610039 China School of Big Data and Artificial Intelligence Chengdu Technological University Chengdu611730 China

Word Sense Disambiguation is a process to determine the best meaning of an ambiguous word according to its contextual semantic information. Many methods of Word Sense Disambiguation cannot deal with polysemous words well because they only consider the meaning of the adjacent words before and after ambiguous words, and cannot consider the meaning of all words in the sentence globally. In order to solve the above problems, this paper proposes a word sense disambiguation method based on Multiple Sense Graph. This method applies the BERT model to generate word sense vectors, and globally considers the feature relationship between the ambiguous word and all words in the context. In addition, this method applies the pagerank algorithm to score the importance of each sense vector of the word, and the scoring results are sorted to obtain the best sense of the ambiguous word. The experimental results indicate that the proposed BERT-pagerank method improves the evaluation index compared with the other two semantic disambiguation methods. In summary, the proposed method improves the accuracy of word sense disambiguation to obtain the best word sense. © 2024 W. Liu, H. Wang, X. Wang & M. Hou.

关键词： BERT Model pagerank algorithm Word Sense Disambiguation Word Sense Disambiguation Graph

来源：评论

学校读者我要写书评

暂无评论

Distributed pagerank Computation with Link Failures

Distributed PageRank Computation with Link Failures

引用

2009 American Control Conference (ACC 2009)

作者： Hideaki Ishii Roberto Tempo Department of Computational Intelligence and Systems Science Tokyo Institute of Technology 4259-J2-54 Nagatsuta-cho Midori-ku Yokohama 226-8502 Japan IEIIT-CNR Politecnico di Torino Corso Duca degli Abruzzi 24 10129 Torino Italy

ISBN: (纸本)9781424445233

The Google search engine employs the so-called pagerank algorithm for ranking the search results. This algorithm quantifies the importance of each web page based on the link structure of the web. In this paper, we continue our recent work on distributed randomized computation of pagerank, where the pages locally determine their values by communicating with linked pages. In particular, we propose a distributed randomized algorithm with limited information, where only part of the linked pages is required to be contacted. This is useful to enhance flexibility and robustness in computation and communication.

关键词： Distributed computation Link failures Multi-agent consensus pagerank algorithm Randomization Stochastic matrices Search engines arithmetic Web pages Distribute COMMUNICATING Web search engines randomized algorithms Flexibility Communication Research

来源：评论

学校读者我要写书评

暂无评论

A New Approach for Aggregated pagerank Computation via Distributed Randomized algorithms

A New Approach for Aggregated PageRank Computation via Distr...

引用

IEEE Conference on Decision and Control

作者： Hideaki Ishii Roberto Tempo Er-Wei Bai Department of Computational Intelligence and Systems Science Tokyo Institute of Technology 4259 Nagatsuta-cho Midori-ku Yokohama 226-8502 Japan IEIIT-CNR Politecnico di Torino Corso Duca degli Abruzzi 24 10129 Torino Italy Department of Electrical and Computer Engineering The University of Iowa 4316 Seamans Center for the Engineering Arts and Sciences Iowa City IA 52242-1527 U.S.A.

ISBN: (纸本)9781612848006

At Google, the pagerank algorithm helps rankings in search results by providing measures of web page importance. This paper builds upon the distributed randomized approach for this algorithm proposed in our recent works. To reduce computation and communication, we develop a method to systematically aggregate web pages into groups by exploiting the sparsity inherent in the web. Each group computes an aggregated pagerank, which can be distributed among group members. We provide a decentralized scheme for its computation and analyze convergence properties.

关键词： Distributed computation Multi-agent consensus pagerank algorithm Randomization Search engines

来源：评论

学校读者我要写书评

暂无评论

Link prediction techniques to handle tax evasion 21

Link prediction techniques to handle tax evasion

引用

3rd ACM India Joint International Conference on Data Science and Management of Data (CODS-COMAD)

作者： Mathews, Jithin Mehta, Priya Suryamukhi, K. Babu, Sobhan Indian Inst Technol Hyderabad Hyderabad Telangana India

ISBN: (纸本)9781450388177

Circular trading of goods is a carefully designed scam ubiquitous among fraudulent business dealers all around the world. Dealers involved in this scheme create an artificial trading network by issuing doctored sales-invoices amongst themselves without any movement of goods. In practice, it is observed that almost all cases of circular trade involve two or three dealers. Here, we work towards predicting circular trade involving three dealers. For the same, we built four different classification models consisting of feature variables tailored for predicting any plausible circular trade amongst three dealers. In particular, the logistic regression model gave the best performance among all the four different models with a prediction accuracy of 80%. Interestingly, we observe that a feature variable formed by using the personalised pagerank technique significantly improves the model over the state of the art link prediction variables. Predicting a future circular trade from a huge network of sales-transactions data is of significant importance to the tax enforcement officers. In addition to automating the process of detecting circular trading, which is manually impossible, this model helps them to target on a set of plausible evaders and take appropriate preventive measures. This model have been developed for the Commercial Taxes Department, Government of Telangana, India, using their first two quarter's tax returns dataset.

关键词： link prediction goods and services tax circular trading tax evasion forensic accounting logistic regression pagerank algorithm

来源：评论

学校读者我要写书评

暂无评论

Ranking influencers of social networks by semantic kernels and sentiment information

引用

EXPERT SYSTEMS WITH APPLICATIONS 2021年 171卷 114599-114599页

作者： Girgin, Berna Altinel Marmara Univ Comp Engn Dept Istanbul Turkey

Inspired by the importance of social media, a Social Network Opinion Leaders (SNOL) system has been proposed in this paper. The purpose of this system is to identify topic-based opinion leaders of social media. In order to accomplish this goal, several steps have been taken, such as data collection, data processing, data analysis, data classification, ranking of topic-based opinion leaders, and evaluation. The SNOL system has two main parts. In the first part, collected tweets are classified by semantic kernels for topic-based analysis. In the second part, leadership scores are given to each user in the network according to topic modeling and user modeling results. Leadership scores are then calculated with the formula generated and opinion leaders are determined for each category. Experiments are performed on data gathered from Twitter including 17,234,924 tweets from 38,727 users. The evaluation of opinion leader detection is a difficult job since there is no standard method for identifying opinion leaders. Therefore, the evaluation of the results of this study has been done using two different methods, retweet count and spread score, to prove that the suggested methodology outperforms the pagerank algorithm. The results have also been evaluated considering the user-topic sentiment correlation of the retrieved lists. Furthermore, SNOL has been compared against some opinion leader detection methods previously presented in the literature. The experimental results show that SNOL generates remarkably higher performance than the pagerank algorithm and other existing algorithms in the literature for nearly all topics and all selected top N opinion leaders.

关键词： Social network analysis Opinion leader detection Flow of influence Sentiment polarity score pagerank algorithm Semantic kernels

来源：评论

学校读者我要写书评

暂无评论

Importance Analysis of System Related Fault Based on Improved Decision-Making Trial and Evaluation Laboratory

引用

MEASUREMENT SCIENCE REVIEW 2022年第5期22卷 214-224页

作者： Xu, Yandong Shen, Guixiang Jilin Univ Key Lab Reliabil CNC Equipment Minist Educ Changchun 130022 Jilin Peoples R China Jilin Univ Sch Mech & Aerosp Engn Changchun 130022 Jilin Peoples R China

The existence of related faults between components brings great difficulties to the analysis of the importance of system components. How to quantify the influence of related faults and evaluate the importance of components is one of the hot issues in current research. In this paper, under the assumption that the fault propagation obeys the Markov process, the pagerank algorithm is integrated into the decision-making trial and evaluation laboratory (DEMATEL). On the basis, the calculation of influencing degree and influenced degree between components is studied to quantify the influence of related faults, and the problem of subjective evaluation of weight coefficient in traditional DEMATEL is solved. The rationality is verified through the method of combining the Interpretative Structural Modeling Method (ISM) and direct relation matrix. The importance of system related faults is identified accurately based on the calculation of center degree and cause degree, and the central-related faults of CNC machine tools are analyzed as an example to verify the effectiveness of the proposed method.

关键词： Decision-Making trial and Evaluation Laboratory (DEMATEL) importance Interpretative Structural Modeling Method (ISM) pagerank algorithm

来源：评论

学校读者我要写书评

暂无评论

Analysis of pollutants transport in heavy air pollution processes using a new complex-network-based model

引用

ATMOSPHERIC ENVIRONMENT 2023年 292卷

作者： Chen, Mei Chen, Yongxu Zhu, Hongyu Wang, Youshuai Xie, Yue Lanzhou Jiaotong Univ Sch Elect & Informat Engn Lanzhou 730070 Peoples R China

A transport analysis model of air pollutants based on complex networks is proposed to study the spatiotemporal variation characteristics of air pollution during heavy air pollution processes and further analyze the contribution and interrelationship of air pollution of different cities. To construct the transmission network for each heavy air pollution process, a link is established between two cities according to the correlation coefficient of pollutants, the angle between the direction of cities and the wind direction, and its weight is assigned by integrating the factors of pollution, meteorology and geography. Then the pagerank algorithm is improved to identify the main contribution areas, and the label propagation algorithm is improved to find the associated air pollution areas. Finally, the period from January 1, 2014 to February 28, 2021 in Beijing-Tianjin-Hebei (BTH) region are used to demonstrate the performance of this model. The results show that a total of 58 heavy air pollution processes occur during the study period, the shortest lasting 3 days and the longest 13 days. These pollution processes occur mainly in winter, especially in January, and there are sufficient data to show that pollution levels decline year on year. Long-term correlation analysis for single-pollutant between different cities shows that geography is one of the most important factors affecting the regional transport of air pollutants. Moreover, according to the statistical analysis of each heavy pollution process, Tangshan, Tianjin and Langfang are the main contribution areas in the pollutant regional transport. In addition, apart from that in Zhangjiakou, Chengde and Qinhuangdao, the pollutants in the other cities in the BTH region have an effect on one another so that these cities are formed as an associated contaminated area. This study can provide better insights into local control and joint prevention of atmospheric pollution.

关键词： Transport analysis model Air pollution transmission network Heavy air pollution process pagerank algorithm Label propagation algorithm Air pollutants

来源：评论

学校读者我要写书评

暂无评论

Visualizing the services embodied in global manufacturing exports

引用

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS 2021年 571卷 125365-125365页

作者： Jiang, Xuemei Zhang, Shaoxue Capital Univ Econ & Business Sch Econ 121 Zhang Jia Lu Kou Beijing 100070 Peoples R China Beijing Municipal Inst Econ & Social Dev Beijing Peoples R China

Nowadays, manufacturing products contain more service value, and this trend is reshaping the global merchandise trade network. Based on a global multi-regional input-output (GMRIO) model and network analysis, we calculate the value added of services embodied in global manufacturing exports and visualize their flows across economies and industries from 2005 to 2015. More specifically, we adapt the pagerank algorithm to select the crucial economies and present four types of networks - networks of the crucial (services) supplier economies and the major user economies for their manufacturing exports, in addition to networks of the crucial manufacturing exporter economies and the major (services) supplier economies for them - at both aggregate and sectoral levels. Our results suggest that at the aggregate level, though some developing economies, such as China, India, and Brazil, are playing an increasingly important role, developed economies still dominate the networks as major users and suppliers. At the industry level, wholesale and retail, other business sectors, and finance and insurance are often recognized as the major (services) suppliers, especially those industries in the United States, Germany, Japan, and France. By contrast, developing economies are more engaged in low value-added service industries, such as transportation and storage. Our findings highlight the importance of servitization in developing economies. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Value added of services Manufacturing exports Network analysis Servitization pagerank algorithm

来源：评论

学校读者我要写书评

暂无评论

Non-Centralised Balance Dispatch Strategy in Waked Wind Farms through a Graph Sparsification Partitioning Approach

引用

ENERGIES 2023年第20期16卷 7131页

作者： Shu, Tong Joo, Young Hoon Jiujiang Univ Sch Elect & Informat Engn Jiujiang 332005 Peoples R China Kunsan Natl Univ Sch IT Informat & Control Engn Kunsan 54150 South Korea

A novel non-centralised dispatch strategy is presented for wake redirection to optimise large-scale offshore wind farms operation, creating a balanced control between power production and fatigue thrust loads evenly among the wind turbines. This approach is founded on a graph sparsification partitioning strategy that takes into account the impact of wake propagation. More specifically, the breadth-first search algorithm is employed to identify the subgraph based on the connectivity of the wake direction graph, while the pagerank centrality computation algorithm is utilised to determine and rank scores for the shared turbines' affiliation with the subgraphs. By doing so, the wind farm is divided into smaller subsets of partitioned turbines, resulting in decoupling. The objective function is then formulated by incorporating penalty terms, specifically the standard deviation of fatigue thrust loads, into the maximum power equation. Meanwhile, the non-centralisation sequential quadratic programming optimisation algorithm is subsequently employed within each partition to determine the control actions while considering the objectives of the respective controllers. Finally, the simulation results of case studies prove to reduce computational costs and improve wind farm power production by balancing accumulated fatigue thrust loads over the operational lifetime as much as possible.

关键词： non-centralisation optimisation offshore wind farm load-balancing pagerank algorithm graph sparsification partitioning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：