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

arXiv 2020年

作者： Guo, Dan Wang, Hui Zhang, Hanwang Zha, Zheng-Jun Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Nanyang Technological University University of Science and Technology of China

Visual dialog is a challenging task that requires the comprehension of the semantic dependencies among implicit visual and textual contexts. This task can refer to the relation inference in a graphical model with sparse contexts and unknown graph structure (relation descriptor), and how to model the underlying context-aware relation inference is critical. To this end, we propose a novel Context-Aware Graph (CAG) neural network. Each node in the graph corresponds to a joint semantic feature, including both object-based (visual) and history-related (textual) context representations. The graph structure (relations in dialog) is iteratively updated using an adaptive top-K message passing mechanism. Specifically, in every message passing step, each node selects the most K relevant nodes, and only receives messages from them. Then, after the update, we impose graph attention on all the nodes to get the final graph embedding and infer the answer. In CAG, each node has dynamic relations in the graph (different related K neighbor nodes), and only the most relevant nodes are attributive to the context-aware relational graph inference. Experimental results on VisDial v0.9 and v1.0 datasets show that CAG outperforms comparative methods. Visualization results further validate the interpretability of our method. Copyright © 2020, The Authors. All rights reserved.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Balanced Tree Partitioning with Succinct Logic

Balanced Tree Partitioning with Succinct Logic

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Xindong Wu Shaojing Sheng Peng Zhou Key Laboratory of Knowledge Engineering with Big Data (Heifei Unversity of Technology) Ministry of Education Heifei China School of Compuster Science and Technology Anhui University Heifei China

ISBN: (数字)9781728181561

ISBN: (纸本)9781728181578

As a widely used data structure, graphs are good at characterizing data with internal associations, such as social and biological data. Tree structured data are special and are widely used in many real-world applications, such as organizational structure analysis and genealogical knowledge graph reasoning. For example, in kinship knowledge graph analysis, when a genealogical tree is particularly large (more than 25 levels and 45,000 nodes), it is a great challenge to partition this large tree into a specified number of subtrees with succinct logic and a balanced number of nodes. Therefore, in this paper, we propose the TPA (tree partitioning algorithm) algorithm to achieve a balanced and succinct logic partition of large-scale tree structured data. TPA first extracts all related nodes from a massive graph database and then constructs the convergent subgraph into a complete tree with a specified root node. Specifically, several virtual nodes are supplemented for generation-skipping connected nodes to achieve correct node numbering and partitioning. Finally, a graph partitioning algorithm is executed on the complete tree to obtain a specified number of subtrees with succinct logic and balanced node scales. Experiments conducted on four real-world datasets verify the effectiveness of our TPA algorithm.

关键词： Partitioning algorithms data visualization Convergence data analysis Distributed databases Big data

来源：评论

学校读者我要写书评

暂无评论

Towards efficient local causal structure learning

arXiv

引用

arXiv 2021年

作者： Yang, Shuai Wang, Hao Yu, Kui Cao, Fuyuan Wu, Xindong The School of Computer Science and Information Engineering Hefei University of Technology Hefei230601 China The School of Computer and Information Technology Shanxi University Taiyuan030006 China The Key Laboratory of Knowledge Engineering With Big Data Ministry of Education Hefei University of Technology Hefei230601 China Mininglamp Academy of Sciences Mininglamp Technology Beijing100102 China

Local causal structure learning aims to discover and distinguish direct causes (parents) and direct effects (children) of a variable of interest from data. While emerging successes have been made, existing methods need to search a large space to distinguish direct causes from direct effects of a target variable T. To tackle this issue, we propose a novel Efficient Local Causal Structure learning algorithm, named ELCS. Specifically, we first propose the concept of N-structures, then design an efficient Markov Blanket (MB) discovery subroutine to integrate MB learning with N-structures to learn the MB of T and simultaneously distinguish direct causes from direct effects of T. With the proposed MB subroutine, ELCS starts from the target variable, sequentially finds MBs of variables connected to the target variable and simultaneously constructs local causal structures over MBs until the direct causes and direct effects of the target variable have been distinguished. Using eight Bayesian networks the extensive experiments have validated that ELCS achieves better accuracy and efficiency than the state-of-the-art algorithms. Copyright © 2021, The Authors. All rights reserved.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Iterative Context-Aware Graph Inference for Visual Dialog

Iterative Context-Aware Graph Inference for Visual Dialog

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Dan Guo Hui Wang Hanwang Zhang Zheng-Jun Zha Meng Wang Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Nanyang Technological University University of Science and Technology of China

ISBN: (数字)9781728171685

ISBN: (纸本)9781728171692

关键词： Visualization History Task analysis Semantics Message passing Neural networks Cognition

来源：评论

学校读者我要写书评

暂无评论

Combining Global and Sequential Patterns for Multivariate Time Series Forecasting

Combining Global and Sequential Patterns for Multivariate Ti...

引用

IEEE International Conference on Big data

作者： Zhaoxi Li Jun He Hongyan Liu Xiaoyong Du Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing China School of Economics and Management Tsinghua g University Beijing China

ISBN: (数字)9781728162515

ISBN: (纸本)9781728162522

Multivariate time series forecasting is very important for many applications. Many studies have been conducted for accurate and interpretable prediction methods. However, existing methods either cannot take both times series and covariates into consideration, lacking of interpretability, or ignore global trends across multivariate time series. In this paper, we aim to solve these issues. To this end, we propose a new model named TEDGE for accurate and interpretable time series prediction. In this model, we extract global trends hidden across multivariate times series to improve prediction accuracy. Meanwhile, we utilize a deep recurrent model with attention mechanism to find long-and short-term sequential patterns hidden in individual time series with interpretability. We conduct experiments on several datasets to evaluate the proposed models performance. Results demonstrate the superior performance of our proposed model.

关键词： Conferences Time series analysis Predictive models Big data Market research data models Forecasting

来源：评论

学校读者我要写书评

暂无评论

Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approach

arXiv

引用

arXiv 2020年

作者： Chen, Lei Wu, Le Hong, Richang Zhang, Kun Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology School of Computer Science and Information Engineering HeFei University of Technology School of Computer Science and Technology University of Science and Technology of China

Graph Convolutional Networks (GCNs) are state-of-the-art graph based representation learning models by iteratively stacking multiple layers of convolution aggregation operations and non-linear activation operations. Recently, in Collaborative Filtering (CF) based Recommender Systems (RS), by treating the user-item interaction behavior as a bipartite graph, some researchers model higher-layer collaborative signals with GCNs. These GCN based recommender models show superior performance compared to traditional works. However, these models suffer from training difficulty with non-linear activations for large user-item graphs. Besides, most GCN based models could not model deeper layers due to the over smoothing effect with the graph convolution operation. In this paper, we revisit GCN based CF models from two aspects. First, we empirically show that removing non-linearities would enhance recommendation performance, which is consistent with the theories in simple graph convolutional networks. Second, we propose a residual network structure that is specifically designed for CF with user-item interaction modeling, which alleviates the over smoothing problem in graph convolution aggregation operation with sparse user-item interaction data. The proposed model is a linear model and it is easy to train, scale to large datasets, and yield better efficiency and effectiveness on two real datasets. We publish the source code at https://***/newlei/LRGCCF. Copyright © 2020, The Authors. All rights reserved.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Cloud detection from visual band of satellite image based on variance of fractal dimension

引用

Journal of Systems engineering and Electronics 2019年第3期30卷 485-491页

作者： TIAN Pingfang GUANG Qiang LIU Xing School of Computer Science and Technology Wuhan University of Science and Technology Wuhan 430065 China Key Laboratory of Intelligent Information Processing and Real-Time Industrial System in Hubei Province Wuhan 430065 China Institute of Big Data Science and Engineering Wuhan University of Science and Technology Wuhan 430065 China Key Laboratory of Rich-Media Knowledge Organization and Service of Digital Publishing Content National Press and Publication Administration Beijing 100038 China

Cover ratio of cloud is a very important factor which affects the quality of a satellite image, therefore cloud detection from satellite images is a necessary step in assessing the image quality. The study on cloud detection from the visual band of a satellite image is developed. Firstly, we consider the differences between the cloud and ground including high grey level, good continuity of grey level, area of cloud region, and the variance of local fractal dimension (VLFD) of the cloud region. A single cloud region detection method is proposed. Secondly, by introducing a reference satellite image and by comparing the variance in the dimensions corresponding to the reference and the tested images, a method that detects multiple cloud regions and determines whether or not the cloud exists in an image is described. By using several Ikonos images, the performance of the proposed method is demonstrated.

关键词： cloud detection visual image satellite image variance of local fractal dimension (VLFD)

来源：评论

学校读者我要写书评

暂无评论

Intervention Prediction for Patients with Pressure Injury Using Random Forest

Intervention Prediction for Patients with Pressure Injury Us...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Liuqi Jin Yan Pan Jiaoyun Yang Lin Han Lin Lv Miki Raviv Ning An Key Laboratory of Knowledge Engineering with Big Data of the Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei China Evidence-Based Nursing Center School of Nursing Lanzhou University Lanzhou China Gansu Provincal Hospital Wound and Ostomy Care Center Lanzhou China Vitalerter LTD Ha-Yarden Airport City Israel

ISBN: (纸本)9781665438599

Pressure injury (PI) is one of the major causes of short-term death. Early intervention for patients at risk plays an essential role in PI. However, many nurses may ignore risks. This paper aims to establish a model to predict interventions according to the patient's physical signs, which can help nurses develop care plans. We used data from 1,483 patients with 25 characteristics and 17 interventions. We use the Random Forest and Particle Swarm Optimization (PSO) to optimize model parameters. Then we compared it with KNN, SVM, and Decision Tree. The 10-fold cross-validation result showed that the Random Forest has better accuracy than other methods, with an f1 score of 0.84. This finding proved the feasibility of using machine learning to help formulate care plans according to the classification of index prediction results. Our model shows that hemoglobin, Braden PI score, and age are the three most influential risk factors.

关键词： Support vector machines Conferences Forestry Predictive models Indexes Decision trees Particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Do we measure novelty when we analyze unusual combinations of cited references? A validation study of bibliometric novelty indicators based on F1000Prime data” [Journal of Informetrics 13/4 (2019) 100979]

引用

Journal of Informetrics 2024年第3期18卷

作者： Lutz Bornmann Alexander Tekles Helena H. Zhang Fred Y. Ye Science Policy and Strategy Department Administrative Headquarters of the Max Planck Society Hofgartenstr. 8 80539 Munich Germany University of Passau Innstr. 41 94032 Passau Germany Jiangsu Key Laboratory of Data Engineering and Knowledge Service School of Information Management Nanjing University Nanjing 210023 China

来源：评论

学校读者我要写书评

暂无评论

data-Driven Single Image Deraining: A Comprehensive Review and New Perspectives

TechRxiv

引用

TechRxiv 2021年

作者： Zhang, Zhao Wei, Yanyan Zhang, Haijun Yang, Yi Yan, Shuicheng Wang, Meng School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei230009 China Shenzhen China Centre for Artificial Intelligence University of Technology Sydney SydneyNSW Australia Department of Electrical and Computer Engineering National University of Singapore Singapore Hefei University of Technology China

Single Image Deraining task aims at recovering the rain-free background from an image degraded by rain streaks and rain accumulation. For the powerful fitting ability of deep neural networks and massive training data, data-driven deep SID methods obtained significant improvement over traditional ones. Current SID methods usually focus on improving the deraining performance by proposing different kinds of deraining networks, while neglecting the interpretation of the solving process. As a result, the generalization ability may still be limited in real-world scenarios, and the deraining results also cannot effectively improve the performance of subsequent high-level tasks (e.g., object detection). To explore these issues, we in this paper re-examine the three important factors (i.e., data, rain model and network architecture) for the SID problem, and specifically analyze them by proposing new and more reasonable criteria (i.e., general vs. specific, synthetical vs. mathematical, black-box vs. white-box). We also study the relationship of the three factors from a new perspective of data, and reveal two different solving paradigms (explicit vs. implicit) for the SID task. We further discuss the current mainstream data-driven SID methods from five aspects, i.e., training strategy, network pipeline, domain knowledge, data preprocessing, and objective function, and some useful conclusions are summarized by statistics. Besides, we profoundly studied one of the three factors, i.e., data, and measured the performance of current methods on different datasets through extensive experiments to reveal the effectiveness of SID data. Finally, with the comprehensive review and in-depth analysis, we draw some valuable conclusions and suggestions for future research. © 2021, CC BY.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：