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

IEEE Transactions on Artificial Intelligence 2022年第6期3卷 924-943页

作者： Cheng, Lu Guo, Ruocheng Moraffah, Raha Sheth, Paras Candan, K. Selcuk Liu, Huan Arizona State University School Of Computing Informatics And Decision Systems Engineering TempeAZ85287 United States City University Of Hong Kong School Of Data Science Hong Kong

The convenient access to copious multifaceted data has encouraged machine learning researchers to reconsider correlation-based learning and embrace the opportunity of causality-based learning, i.e., causal machine learning (causal learning). Recent years have, therefore, witnessed great effort in developing causal learning algorithms aiming to help artificial intelligence (AI) achieve human-level intelligence. Due to the lack of ground-truth data, one of the biggest challenges in current causal learning research is algorithm evaluations. This largely impedes the cross-pollination of AI and causal inference and hinders the two fields to benefit from the advances of the other. To bridge from conventional causal inference (i.e., based on statistical methods) to causal learning with Big Data (i.e., the intersection of causal inference and machine learning), in this survey, we review commonly used datasets, evaluation methods, and measures for causal learning using an evaluation pipeline similar to conventional machine learning. We focus on the two fundamental causal inference tasks and causality-aware machine learning tasks. Limitations of current evaluation procedures are also discussed. We, then, examine popular causal inference tools/packages and conclude with primary challenges and opportunities for benchmarking causal learning algorithms in the era of Big Data. The survey seeks to bring to the forefront the urgency of developing publicly available benchmarks and consensus-building standards for causal learning evaluation with observational data. In doing so, we hope to broaden the discussions and facilitate collaboration to advance the innovation and application of causal learning. © 2020 IEEE.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

Efficient 3D Hilbert Curve Encoding and Decoding Algorithms

引用

Chinese Journal of Electronics 2022年第2期31卷 277-284页

作者： JIA Lianyin LIANG Binbin LI Mengjuan LIU Yong CHEN Yinong DING Jiaman Faculty of Information Engineering and Automation Kunming University of Science and Technology Yunnan Key Laboratory of Artificial Intelligence Kunming University of Science and Technology Library Yunnan Normal University School of Information Science and Engineering Guangxi University for Nationalities School of Computing Informatics and Decision Systems Arizona State University

Hilbert curve describes a one-to-one mapping between multidimensional space and 1 D *** traditional 3D Hilbert encoding and decoding algorithms work on order-wise manner and are not aware of the difference between different input data and spend equivalent computing costs on them, thus resulting in a low efficiency. To solve this problem, in this paper we design efficient 3D state views for fast encoding and decoding. Based on the state views designed, a new encoding algorithm(JFK-3HE) and a new decoding algorithm(JFK-3HD) are proposed. JFK-3HE and JFK-3HD can avoid executing iteratively encoding or decoding each order by skipping the first 0 s in input data, thus decreasing the complexity and improving the efficiency. Experimental results show that JFK-3HE and JFK-3HD outperform the state-of-the-arts algorithms for both uniform and skew-distributed data.

关键词： order-wise manner multidimensional space encoding state-of-the-arts algorithms encoding algorithm parallel algorithms JFK-3HE statistical distributions decoding solid modelling design efficient 3D JFK-3HD traditional 3D Hilbert encoding equivalent computing costs different input data decoding algorithm Hilbert curve state views iterative methods

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Network Design for Bounded Delay Data Transfer from PMUs to Control Center

Fault-Tolerant Network Design for Bounded Delay Data Transfe...

引用

International Workshop on Design of Reliable Communication Networks (DRCN)

作者： A. Sen C. Sumnicht S. Adeniye D. Patel S. Choudhuri School of Computing Informatics and Decision Systems Engg. Arizona State University Tempe AZ USA

ISBN: (数字)9798350348972

ISBN: (纸本)9798350348989

Communication network design for monitoring the state of an electric power grid has received significant attention in recent years. In order to measure stability of a power grid, it is imperative that measurement data collected by the Phasor Measurement Units (PMUs) located at the Sub-Stations (SS) must arrive at the Control Center (CC) within a specified delay threshold $\delta$ . In earlier papers we formalized the design problem as the Rooted Delay Constrained Minimum Spanning Tree (RDCMST) problem. However, RDCMST does not provide any fault-tolerance capability, as failure of just one communication link would prevent PMU data from reaching the CC. In this paper, we study the optimal cost network design problem with fault tolerance capability. In our model the PMU data from the SSs will have a path to reach the CC in spite of the failure of at most $R$ links within the delay threshold $\delta$ . If $R=1$ , each SS will have two link disjoint paths of length at most $\delta$ to the CC. In other words, each SS will be on a cycle with the CC. We refer to this problem as the Rooted Delay Constrained Minimum Cost Cycle Cover (RDCMCCC) problem. We provide computational complexity analysis, an Integer Linear Programming formulation to find the optimal solution and a heuristic based on the sweeping technique. We evaluate the performance of our heuristic with real substation location data of Arizona.

关键词： Fault tolerance Costs Power measurement Substations Fault tolerant systems Reliability theory Phasor measurement units

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant Network Design for Bounded Delay Data Transfer from PMUs to Control Center

arXiv

引用

arXiv 2024年

作者： Sen, A. Sumnicht, C. Adeniye, S. Patel, D. Choudhuri, S. School of Computing Informatics and Decision Systems Engg. Arizona State University TempeAZ85287 United States

Communication network design for monitoring the state of an electric power grid has received significant attention in recent years. In order to measure stability of a power grid, it is imperative that measurement data collected by the Phasor Measurement Units (PMUs) located at the Sub-Stations (SS) must arrive at the Control Center (CC) within a specified delay threshold δ. In earlier papers we formalized the design problem as the Rooted Delay Constrained Minimum Spanning Tree (RDCMST) problem. However, RDCMST does not provide any fault-tolerance capability, as failure of just one communication link would prevent PMU data from reaching the CC. In this paper, we study the optimal cost network design problem with fault tolerance capability. In our model the PMU data from the SSs will have a path to reach the CC in spite of the failure of at most R links within the delay threshold δ. If R = 1, each SS will have two link disjoint paths of length at most δ to the CC. In other words, each SS will be on a cycle with the CC. We refer to this problem as the Rooted Delay Constrained Minimum Cost Cycle Cover (RDCMCCC) problem. We provide computational complexity analysis, an Integer Linear Programming formulation to find the optimal solution and a heuristic based on the sweeping technique. We evaluate the performance of our heuristic with real substation location data of Arizona. Copyright © 2024, The Authors. All rights reserved.

关键词： Phasor measurement units

来源：评论

学校读者我要写书评

暂无评论

First-Order Stable Model Semantics with Intensional Functions

arXiv

引用

arXiv 2023年

作者： Bartholomew, Michael Lee, Joohyung School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe United States

In classical logic, nonBoolean fluents, such as the location of an object, can be naturally described by functions. However, this is not the case in answer set programs, where the values of functions are pre-defined, and nonmonotonicity of the semantics is related to minimizing the extents of predicates but has nothing to do with functions. We extend the first-order stable model semantics by Ferraris, Lee, and Lifschitz to allow intensional functions - functions that are specified by a logic program just like predicates are specified. We show that many known properties of the stable model semantics are naturally extended to this formalism and compare it with other related approaches to incorporating intensional functions. Furthermore, we use this extension as a basis for defining Answer Set Programming Modulo Theories (ASPMT), analogous to the way that Satisfiability Modulo Theories (SMT) is defined, allowing for SMT-like effective first-order reasoning in the context of ASP. Using SMT solving techniques involving functions, ASPMT can be applied to domains containing real numbers and alleviates the grounding problem. We show that other approaches to integrating ASP and CSP/SMT can be related to special cases of ASPMT in which functions are limited to non-intensional ones. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Biomedical Named Entity Recognition via Knowledge Guidance and Question Answering

引用

ACM Transactions on computing for Healthcare 2021年第4期2卷 1–24页

作者： Banerjee, Pratyay Pal, Kuntal Kumar Devarakonda, Murthy Baral, Chitta School of Computing Informatics Decision Systems Engineering Arizona State University 699 S. Mill Avenue TempeAZ85281 United States

In this work, we formulated the named entity recognition (NER) task as a multi-answer knowledge guided question-answer task (KGQA) and showed that the knowledge guidance helps to achieve state-of-the-art results for 11 of 18 biomedical NER datasets. We prepended five different knowledge contexts -entity types, questions, definitions, and examples -to the input text and trained and tested BERT-based neural models on such input sequences from a combined dataset of the 18 different datasets. This novel formulation of the task (a) improved named entity recognition and illustrated the impact of different knowledge contexts, (b) reduced system confusion by limiting prediction to a single entity-class for each input token (i.e., B, I, O only) compared to multiple entity-classes in traditional NER (i.e., Bentity1, Bentity2, Ientity1, I, O), (c) made detection of nested entities easier, and (d) enabled the models to jointly learn NER-specific features from a large number of datasets. We performed extensive experiments of this KGQA formulation on the biomedical datasets, and through the experiments, we showed when knowledge improved named entity recognition. We analyzed the effect of the task formulation, the impact of the different knowledge contexts, the multi-task aspect of the generic format, and the generalization ability of KGQA. We also probed the model to better understand the key contributors for these improvements. © 2021 ACM.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

GeoLinter: A Linting Framework for Choropleth Maps

arXiv

引用

arXiv 2023年

作者： Lei, Fan Fan, Arlen MacEachren, Alan M. Maciejewski, Ross The School of Computing Informatics & Decision Systems Engineering Arizona State University United States Pennsylvania State University United States

Visualization linting is a proven effective tool in assisting users to follow established visualization guidelines. Despite its success, visualization linting for choropleth maps, one of the most popular visualizations on the internet, has yet to be investigated. In this paper, we present GeoLinter, a linting framework for choropleth maps that assists in creating accurate and robust maps. Based on a set of design guidelines and metrics drawing upon a collection of best practices from the cartographic literature, GeoLinter detects potentially suboptimal design decisions and provides further recommendations on design improvement with explanations at each step of the design process. We perform a validation study to evaluate the proposed framework's functionality with respect to identifying and fixing errors and apply its results to improve the robustness of GeoLinter. Finally, we demonstrate the effectiveness of the GeoLinter - validated through empirical studies - by applying it to a series of case studies using real-world datasets. Copyright © 2023, The Authors. All rights reserved.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

A Proposal to Study "Is High Quality Data All We Need?"

arXiv

引用

arXiv 2022年

作者： Mishra, Swaroop Arunkumar, Anjana School of Computing Informatics and Decision Systems Engineering Arizona State University United States

Even though deep neural models have achieved superhuman performance on many popular benchmarks, they have failed to generalize to OOD or adversarial datasets. Conventional approaches aimed at increasing robustness include developing increasingly large models and augmentation with large scale datasets. However, orthogonal to these trends, we hypothesize that a smaller, high quality dataset is what we need. Our hypothesis is based on the fact that deep neural networks are data driven models, and data is what leads/misleads models. In this work, we propose an empirical study that examines how to select a subset of and/or create high quality benchmark data, for a model to learn effectively. We seek to answer if big datasets are truly needed to learn a task, and whether a smaller subset of high quality data can replace big datasets. We plan to investigate both data pruning and data creation paradigms to generate high quality datasets. Copyright © 2022, The Authors. All rights reserved.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Bayesian estimation-based sentiment word embedding model for sentiment analysis

引用

CAAI Transactions on Intelligence Technology 2022年第2期7卷 144-155页

作者： Jingyao Tang Yun Xue Ziwen Wang Shaoyang Hu Tao Gong Yinong Chen Haoliang Zhao Luwei Xiao Guangdong Provincial Key Laboratory of Quantum Engineering and Quantum Materials School of Physics and Telecommunication EngineeringSouth China Normal UniversityGuangzhouChina College of Mathematics and Informatics&College of Software Engineering South China Agricultural UniversityGuangzhouChina School of Foreign Languages Zhejiang University of Finance&EconomicsHangzhouZhejiangChina Educational Testing Service PrincetonNew JerseyUSA School of Computing Informatics and Decision Systems EngineeringArizona State UniversityTempeUSA

Sentiment word embedding has been extensively studied and used in sentiment analysis ***,most existing models have failed to differentiate high-frequency and low-frequency ***,the sentiment information of low-frequency words is insufficiently captured,thus resulting in inaccurate sentiment word embedding and degradation of overall performance of sentiment analysis.A Bayesian estimation-based sentiment word embedding(BESWE)model,which aims to precisely extract the sentiment information of low-frequency words,has been *** the model,a Bayesian estimator is constructed based on the co-occurrence probabilities and sentiment proba-bilities of words,and a novel loss function is defined for sentiment word embedding *** experimental results based on the sentiment lexicons and Movie Review dataset show that BESWE outperforms many state-of-the-art methods,for example,C&W,CBOW,GloVe,SE-HyRank and DLJT1,in sentiment analysis tasks,which demonstrate that Bayesian estimation can effectively capture the sentiment information of low-frequency words and integrate the sentiment information into the word embedding through the loss *** addition,replacing the embedding of low-frequency words in the state-of-the-art methods with BESWE can significantly improve the performance of those methods in sentiment analysis tasks.

关键词： function embedding estimation

来源：评论

学校读者我要写书评

暂无评论

A novel analytical model for estimating vehicle delay at isolated signalised intersections

引用

International Journal of Simulation and Process Modelling 2022年第1-2期19卷 71-85页

作者： Qiao, Feng Liu, Huixin Luo, Dan Sun, Haochen Chen, Yinong School of Information and Control Engineering Shenyang Institute of Technology Fushun113122 China Faculty of Information and Control Engineering Shenyang Jianzhu University Shenyang100168 China School of Information Engineering Henan University of Science and Technology Henan Luoyang471000 China School of Computing Informatics and Decision Systems Engineering Arizona State University TempeAZ85287-8809 United States

This paper proposes a novel analytical model to estimate the average vehicle delay at signalised intersections under saturated or oversaturated conditions based on the investigation and analysis of the existing methods to deal with the problems arising in the process of acceleration, deceleration, and the transmissibility of the cycle-by-cycle average vehicle delay. The proposed model employs and combines the operating and queuing characteristics of vehicles to produce the analytic formula. To verify the effectiveness of the proposed model, simulation experiments are conducted, and the error rates and the correlation coefficients are investigated, which confirm that the proposed model possesses certain significant advantages over the existing models in saturated and oversaturated conditions. The results of research work show that the proposed model can provide transportation engineers or professionals with an effective tool for analysing, timing and managing the saturated or oversaturated signalised intersections. © 2022 Inderscience Enterprises Ltd.

关键词： Analytical models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：