咨询与建议

限定检索结果

文献类型

  • 4 篇 期刊文献
  • 1 篇 会议

馆藏范围

  • 5 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 5 篇 工学
    • 4 篇 计算机科学与技术...
    • 2 篇 控制科学与工程
    • 2 篇 软件工程
    • 1 篇 信息与通信工程
  • 1 篇 理学
    • 1 篇 数学

主题

  • 5 篇 ida algorithm
  • 2 篇 causal discovery
  • 2 篇 model selection
  • 2 篇 efficiency
  • 2 篇 confounder selec...
  • 2 篇 sufficient adjus...
  • 2 篇 proof of retriev...
  • 2 篇 causal inference
  • 2 篇 cloud storage
  • 2 篇 confounding
  • 2 篇 graphical models
  • 1 篇 problem solving
  • 1 篇 big data
  • 1 篇 dynamic
  • 1 篇 search
  • 1 篇 a algorithm
  • 1 篇 hashing techniqu...

机构

  • 2 篇 nanjing univ sci...
  • 1 篇 deakin univ sch ...
  • 1 篇 leibniz institut...
  • 1 篇 guizhou univ gui...
  • 1 篇 scuola normale s...
  • 1 篇 univ bremen fac ...
  • 1 篇 seminar for stat...
  • 1 篇 swiss fed inst t...
  • 1 篇 leibniz inst pre...

作者

  • 2 篇 li yuhan
  • 2 篇 fu anmin
  • 2 篇 yu yan
  • 2 篇 zhang gongxuan
  • 1 篇 manzini giovanni
  • 1 篇 vanessa didelez
  • 1 篇 janine witte
  • 1 篇 maathuis marloes...
  • 1 篇 yu shui
  • 1 篇 didelez vanessa
  • 1 篇 henckel leonard
  • 1 篇 leonard henckel
  • 1 篇 marloes h. maath...
  • 1 篇 witte janine

语言

  • 5 篇 英文
检索条件"主题词=IDA algorithm"
5 条 记 录,以下是1-10 订阅
排序:
On Efficient Adjustment in Causal Graphs
收藏 引用
JOURNAL OF MACHINE LEARNING RESEARCH 2020年 第1期21卷 1-45页
作者: Witte, Janine Henckel, Leonard Maathuis, Marloes H. Didelez, Vanessa Leibniz Inst Prevent Res & Epidemiol BIPS Bremen Germany Univ Bremen Fac Math & Comp Sci Bremen Germany Swiss Fed Inst Technol Seminar Stat Zurich Switzerland
We consider estimation of a total causal effect from observational data via covariate adjustment. Ideally, adjustment sets are selected based on a given causal graph, reflecting knowledge of the underlying causal stru... 详细信息
来源: 评论
DIPOR: An ida-based dynamic proof of retrievability scheme for cloud storage systems
收藏 引用
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2018年 104卷 97-106页
作者: Fu, Anmin Li, Yuhan Yu, Shui Yu, Yan Zhang, Gongxuan Nanjing Univ Sci & Technol Sch Comp Sci & Engn Nanjing 210094 Jiangsu Peoples R China Guizhou Univ Guizhou Prov Key Lab Publ Big Data Guiyang 550025 Guizhou Peoples R China Deakin Univ Sch Informat Technol Melbourne Vic 3125 Australia
As cloud storage has become more and more ubiquitous, there are a large number of consumers renting cloud storage services. However, as users lose direct control over the data, the integrity and availability of the ou... 详细信息
来源: 评论
IPOR: An efficient ida-based proof of retrievability scheme for cloud storage systems
IPOR: An efficient IDA-based proof of retrievability scheme ...
收藏 引用
IEEE International Conference on Communications (ICC) / Wireless Communications Symposium / 3rd Workshop on Optical Wireless Communications (OWC)
作者: Li, Yuhan Fu, Anmin Yu, Yan Zhang, Gongxuan Nanjing Univ Sci & Technol Sch Comp Sci & Engn Nanjing Jiangsu Peoples R China
With the arrival of big data era, cloud storage has become more ubiquitous. A growing number of consumers remote their data into cloud, as cloud can provide them with ample storage space and powerful computational cap... 详细信息
来源: 评论
On efficient adjustment in causal graphs
The Journal of Machine Learning Research
收藏 引用
The Journal of Machine Learning Research 2020年 第1期21卷 9956-10000页
作者: Janine Witte Leonard Henckel Marloes H. Maathuis Vanessa Didelez Leibniz Institute for Prevention Research and Epidemiology BIPS Bremen Germany and Faculty of Mathematics and Computer Science University of Bremen Germany Seminar for Statistics ETH Zurich Switzerland
We consider estimation of a total causal effect from observational data via covariate adjustment. Ideally, adjustment sets are selected based on a given causal graph, reflecting knowledge of the underlying causal stru... 详细信息
来源: 评论
Searching graphs using mixed strategies
收藏 引用
Journal of Experimental and Theoretical Artificial Intelligence 1994年 第4期3卷 311-317页
作者: Manzini, Giovanni Scuola Normale Superiore Pisa I-56126 Piazza dei Cavalieri 7 Italy
In this paper we describe a collection of heuristic search algorithms which use mixed ‘best-first’ and ‘depth-first’ strategies. These algorithms are designed to match the actual features of modern computers that ... 详细信息
来源: 评论