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

The Brain Tumor Sequence Registration (BraTS-Reg) Challenge: Establishing Correspondence Between Pre-Operative and Follow-up MRI Scans of Diffuse Glioma Patients

arXiv

引用

arXiv 2021年

作者： Baheti, Bhakti Chakrabarty, Satrajit Akbari, Hamed Bilello, Michel Wiestler, Benedikt Schwarting, Julian Calabrese, Evan Rudie, Jeffrey Abidi, Syed Mousa, Mina Villanueva-Meyer, Javier Fields, Brandon K.K. Kofler, Florian Shinohara, Russell Takeshi Iglesias, Juan Eugenio Mok, Tony C.W. Chung, Albert C.S. Wodzinski, Marek Jurgas, Artur Marini, Niccolò Atzori, Manfredo Müller, Henning Grosbröhmer, Christoph Siebert, Hanna Hansen, Lasse Heinrich, Mattias P. Canalini, Luca Klein, Jan Gerken, Annika Heldmann, Stefan Hering, Alessa Hahn, Horst K. Meng, Mingyuan Bi, Lei Feng, Dagan Kim, Jinman Zeineldinal, Ramy A. Karar, Mohamed E. Mathis-Ullrich, Franziska Burgert, Oliver Abderezaei, Javid Pionteck, Aymeric Chopra, Agamdeep Kurt, Mehmet Yan, Kewei Yan, Yonghong Tang, Zhe Ma, Jianqiang Nasser, Sahar Almahfouz Kurian, Nikhil Cherian Meena, Mohit Shamsi, Saqib Sethi, Amit Tustison, Nicholas J. Avants, Brian B. Cook, Philip Gee, James C. Tian, Lin Greer, Hastings Niethammer, Marc Hoopesar, Andrew Hoffmannas, Malte Dalcaar, Adrian V. Christodoulidis, Stergios Estiene, Théo Vakalopoulou, Maria Paragios, Nikos Marcus, Daniel S. Davatzikos, Christos Sotiras, Aristeidis Menze, Bjoern Bakas, Spyridon Waldmannstetter, Diana Division of Computational Pathology Department of Pathology and Laboratory Medicine Indiana University School of Medicine IndianapolisIN United States Department of Electrical and Systems Engineering Washington University in St. Louis St. LouisMO United States GE HealthCare San RamonCA United States University of Pennsylvania PhiladelphiaPA United States Department of Radiology Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Mallinckrodt Institute of Radiology Washington University School of Medicine St. LouisMO United States Institute for Informatics Data Science & Biostatistics Washington University School of Medicine St. LouisMO United States Department of Bioengineering Santa Clara University Santa ClaraCA United States Department of Quantitative Biomedicine University of Zurich Zurich Switzerland Department of Computer Science TUM School of Computation Information and Technology Technical University of Munich Munich Germany Department of Diagnostic and Interventional Neuroradiology School of Medicine Klinikum rechts der Isar Technical University of Munich Munich Germany Department of Nuclear Medicine University Hospital Regensburg Regensburg Germany University Hospital Regensburg Regensburg Germany Department of Radiology & Biomedical Imaging University of California San FranciscoCA United States Department of Radiology Duke University Medical Center DurhamNC United States Department of Radiology University of California San DiegoCA United States Helmholtz AI Helmholtz Munich Neuherberg Germany Penn Statistics in Imaging and Visualization Center Department of Biostatistics Epidemiology and Informatics University of Pennsylvania Philadelphia United States Massachusetts General Hospital Harvard Medical School United States Centre for Medical Imaging Computing University College London United Kingdom The Hong Kong University of Science and Technology Hong Kong University of Applied Sciences West

Registration of longitudinal brain Magnetic Resonance Imaging (MRI) scans containing pathologies is challenging due to dramatic changes in tissue appearance. Although there has been considerable progress in developing general-purpose medical image registration techniques, they have not yet attained the requisite precision and reliability for this task, highlighting its inherent complexity. Here we describe the Brain Tumor Sequence Registration (BraTS-Reg) challenge, as the first public benchmark environment for deformable registration algorithms focusing on estimating correspondences between pre-operative and follow-up scans of the same patient diagnosed with a diffuse brain glioma. The challenge was conducted in conjunction with both the IEEE International Symposium on Biomedical Imaging (ISBI) 2022 and the International Conference on Medical Image Computing and computer-Assisted Intervention (MICCAI) 2022. The BraTS-Reg data comprise de-identified multi-institutional multi-parametric MRI (mpMRI) scans, curated for size and resolution according to a canonical anatomical template, and divided into training, validation, and testing sets. Clinical experts annotated ground truth (GT) landmark points of anatomical locations distinct across the temporal domain. The training data with their GT annotations, were publicly released to enable the development of registration algorithms. The validation data, without their GT annotations, were also released to allow for algorithmic evaluation prior to the testing phase, which only allowed submission of containerized algorithms for evaluation on hidden hold-out testing data. Quantitative evaluation and ranking was based on the Median Euclidean Error (MEE), Robustness, and the determinant of the Jacobian of the displacement field. The top-ranked methodologies yielded similar performance across all evaluation metrics and shared several methodological commonalities, including pre-alignment, deep neural networks, inverse consistency

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

OPTIMADE, an API for exchanging materials data

arXiv

引用

arXiv 2021年

作者： Andersen, Casper W. Armiento, Rickard Blokhin, Evgeny Conduit, Gareth J. Dwaraknath, Shyam Evans, Matthew L. Fekete, Ádám Gopakumar, Abhijith Gražulis, Saulius Merkys, Andrius Mohamed, Fawzi Oses, Corey Pizzi, Giovanni Rignanese, Gian-Marco Scheidgen, Markus Talirz, Leopold Toher, Cormac Winston, Donald Aversa, Rossella Choudhary, Kamal Colinet, Pauline Curtarolo, Stefano Di Stefano, Davide Draxl, Claudia Er, Suleyman Esters, Marco Fornari, Marco Giantomassi, Matteo Govoni, Marco Hautier, Geoffroy Hegde, Vinay Horton, Matthew K. Huck, Patrick Huhs, Georg Hummelshøj, Jens Kariryaa, Ankit Kozinsky, Boris Kumbhar, Snehal Liu, Mohan Marzari, Nicola Morris, Andrew J. Mostofi, Arash A. Persson, Kristin A. Petretto, Guido Purcell, Thomas Ricci, Francesco Rose, Frisco Scheffler, Matthias Speckhard, Daniel Uhrin, Martin Vaitkus, Antanas Villars, Pierre Waroquiers, David Wolverton, Chris Wu, Michael Yang, Xiaoyu École Polytechnique Fédérale de Lausanne Lausanne1015 Switzerland Materials Design and Informatics Unit Department of Physics Chemistry and Biology Linköping University Sweden Tilde Materials Informatics Straßmannstraße 25 Berlin10249 Germany Materials Platform for Data Science Sepapaja 6 Tallinn15551 Estonia Theory of Condensed Matter Group Cavendish Laboratory 19 J.J. Thomson Avenue CambridgeCB3 0HE United Kingdom Lawrence Berkeley Labs BerkeleyCA United States Chemin des Étoiles 8 Louvain-la-Neuve1348 Belgium Department of Physics King's College London London United Kingdom Department of Materials Science and Engineering Northwestern University EvanstonIL60208 United States Institute of Biotechnology Life Science Center Vilnius University Saulétekio av. 7 VilniusLT-10257 Lithuania Institute of Computer Science Faculty of Mathematics and Informatics Vilnius University Naugarduko g. 24 VilniusLT-03225 Lithuania Fritz-Haber-Institut der Max-Planck-Gesellschaft Faradayweg 4-6 Berlin14195 Germany Center for Autonomous Materials Design Duke University DurhamNC27708 United States Department of Mechanical Engineering and Materials Science Duke University DurhamNC27708 United States Humboldt-Universität zu Berlin Institut für Physik and IRIS Adlershof Berlin12489 Germany École Polytechnique Fédérale de Lausanne Sion1951 Switzerland Trieste34136 Italy Hermann-von-Helmholtz-Platz 1 Eggenstein-Leopoldshafen76344 Germany Materials Measurement Laboratory National Institute of Standards and Technology GaithersburgMD20899 United States Ansys 300 Rustat House 62 Clifton Rd CambridgeCB1 7EG United Kingdom De Zaale 20 Eindhoven5612 AJ Netherlands Department of Physics and Science of Advanced Materials Program Central Michigan University Mount PleasantMI48859 United States Argonne National Laboratory LemontIL60439 United States Thayer School of Engineering Dartmouth College HanoverNH03755 United States Los AltosCA940

The Open databases Integration for Materials Design (OPTIMADE) consortium has designed a universal application programming interface (API) to make materials databases accessible and interoperable. We outline the first stable release of the specification, v1.0, which is already supported by many leading databases and several software packages. We illustrate the advantages of the OPTIMADE API through worked examples on each of the public materials databases that support the full API specification. © 2021, CC BY.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Ten quick tips for deep learning in biology

arXiv

引用

arXiv 2021年

作者： Lee, Benjamin D. Gitter, Anthony Greene, Casey S. Raschka, Sebastian Maguire, Finlay Titus, Alexander J. Kessler, Michael D. Lee, Alexandra J. Chevrette, Marc G. Stewart, Paul Allen Britto-Borges, Thiago Cofer, Evan M. Yu, Kun-Hsing Carmona, Juan Jose Fertig, Elana J. Kalinin, Alexandr A. Signal, Beth Lengerich, Benjamin J. Triche, Timothy J. Boca, Simina M. In-Q-Tel Labs School of Engineering and Applied Sciences Harvard University Department of Genetics Harvard Medical School United States Department of Biostatistics and Medical Informatics University of Wisconsin-Madison MadisonWI United States Morgridge Institute for Research MadisonWI United States Department of Systems Pharmacology and Translational Therapeutics Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Department of Biochemistry and Molecular Genetics University of Colorado School of Medicine AuroraCO United States Center for Health AI University of Colorado School of Medicine AuroraCO United States Department of Statistics University of Wisconsin Madison United States Faculty of Computer Science Dalhousie University Canada University of New Hampshire Bioeconomy.XYZ United States Department of Oncology Johns Hopkins University United States Institute for Genome Sciences University of Maryland School of Medicine United States Genomics and Computational Biology Graduate Program University of Pennsylvania United States Department of Systems Pharmacology and Translational Therapeutics University of Pennsylvania United States Wisconsin Institute for Discovery Department of Plant Pathology University of Wisconsin-Madison United States Department of Biostatistics and Bioinformatics Moffitt Cancer Center TampaFL United States Section of Bioinformatics and Systems Cardiology Klaus Tschira Institute for Integrative Computational Cardiology University Hospital Heidelberg Germany University Hospital Heidelberg Germany Lewis-Sigler Institute for Integrative Genomics Princeton University PrincetonNJ United States Graduate Program in Quantitative and Computational Biology Princeton University PrincetonNJ United States Department of Biomedical Informatics Harvard Medical School United States Department of Pathology Brigham and Women's Hospital United States Philips Healthcare CambridgeMA United States Philips Research

Machine learning is a modern approach to problem-solving and task automation. In particular, machine learning is concerned with the development and applications of algorithms that can recognize patterns in data and use them for predictive modeling. Artificial neural networks are a particular class of machine learning algorithms and models that evolved into what is now described as deep learning. Given the computational advances made in the last decade, deep learning can now be applied to massive data sets and in innumerable contexts. Therefore, deep learning has become its own subfield of machine learning. In the context of biological research, it has been increasingly used to derive novel insights from high-dimensional biological data. To make the biological applications of deep learning more accessible to scientists who have some experience with machine learning, we solicited input from a community of researchers with varied biological and deep learning interests. These individuals collaboratively contributed to this manuscript's writing using the GitHub version control platform and the Manubot manuscript generation toolset. The goal was to articulate a practical, accessible, and concise set of guidelines and suggestions to follow when using deep learning. In the course of our discussions, several themes became clear: the importance of understanding and applying machine learning fundamentals as a baseline for utilizing deep learning, the necessity for extensive model comparisons with careful evaluation, and the need for critical thought in interpreting results generated by deep learning, among others. © 2021, CC BY.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

s-LWSR: Super lightweight super-resolution network

arXiv

引用

arXiv 2019年

作者： Li, Biao Liu, Jiabin Wang, Bo Qi, Zhiquan Shi, Yong School of Economics and Management University of Chinese Academy of Sciences Beijing101408 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China School of Information Technology and Management University of International Business and Economics Beijing100029 China Department of Computer Science and Engineering Texas A&M University College StationTX77843 United States College of Information Science and Technology University of Nebraska OmahaNE68182 United States

Deep learning (DL) architectures for super-resolution (SR) normally contain tremendous parameters, which has been regarded as the crucial advantage for obtaining satisfying performance. However, with the widespread use of mobile phones for taking and retouching photos, this character greatly hampers the deployment of DL-SR models on the mobile devices. To address this problem, in this paper, we propose a super lightweight SR network: s-LWSR. There are mainly three contributions in our work. Firstly, in order to efficiently abstract features from the low resolution image, we build an information pool to mix multi-level information from the first half part of the pipeline. Accordingly, the information pool feeds the second half part with the combination of hierarchical features from the previous layers. Secondly, we employ a compression module to further decrease the size of parameters. Intensive analysis confirms its capacity of trade-off between model complexity and accuracy. Thirdly, by revealing the specific role of activation in deep models, we remove several activation layers in our SR model to retain more information for performance improvement. Extensive experiments show that our s-LWSR, with limited parameters and operations, can achieve similar performance to other cumbersome DL-SR methods. Copyright © 2019, The Authors. All rights reserved.

关键词： Chemical activation

来源：评论

学校读者我要写书评

暂无评论

An easy & collaborative RDF data entry method using the spreadsheet metaphor

arXiv

引用

arXiv 2018年

作者： Schröder, Markus Jilek, Christian Hees, Jörn Hertling, Sven Dengel, Andreas GmbH Trippstadter Straße 122 Kaiserslautern67663 Germany Data and Web Science Group University of Mannheim Germany Knowledge-Based Systems Group Department of Computer Science TU Kaiserslautern P.O. Box 3049 Kaiserslautern67653 Germany

Spreadsheets are widely used by knowledge workers, especially in the industrial sector. Their methodology enables a well understood, easy and fast possibility to enter data. As filling out a spreadsheet is more accessible to common knowledge workers than defining RDF statements, in this paper, we propose an easy-to-use, zero-configuration, web-based spreadsheet editor that simultaneously transfers spreadsheet entries into RDF statements. It enables various kinds of users to easily create semantic data whether they are RDF experts or novices. The typical scenario we address focuses on creating instance data starting with an empty knowledge base that is filled incrementally. In a user study, participants were able to create more statements in shorter time, having similar or even significantly outperforming quality, compared to other approaches. Copyright © 2018, The Authors. All rights reserved.

关键词： knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

iSplit LBI: Individualized partial ranking with ties via split LBI

arXiv

引用

arXiv 2019年

作者： Xu, Qianqian Sun, Xinwei Yang, Zhiyong Cao, Xiaochun Huang, Qingming Yao, Yuan Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Microsoft Research Asia State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Tech. University of Chinese Academy of Sciences Key Laboratory of Big Data Mining and Knowledge Management CAS Peng Cheng Laboratory Department of Mathematics Hong Kong University of Science and Technology Hong Kong

Due to the inherent uncertainty of data, the problem of predicting partial ranking from pairwise comparison data with ties has attracted increasing interest in recent years. However, in real-world scenarios, different individuals often hold distinct preferences. It might be misleading to merely look at a global partial ranking while ignoring personal diversity. In this paper, instead of learning a global ranking which is agreed with the consensus, we pursue the tie-aware partial ranking from an individualized perspective. Particularly, we formulate a unified framework which not only can be used for individualized partial ranking prediction, but also be helpful for abnormal user selection. This is realized by a variable splitting-based algorithm called iSplitLBI. Specifically, our algorithm generates a sequence of estimations with a regularization path, where both the hyperparameters and model parameters are updated. At each step of the path, the parameters can be decomposed into three orthogonal parts, namely, abnormal signals, personalized signals and random noise. The abnormal signals can serve the purpose of abnormal user selection, while the abnormal signals and personalized signals together are mainly responsible for individual partial ranking prediction. Extensive experiments on simulated and real-world datasets demonstrate that our new approach significantly outperforms state-of-the-art alternatives. The code is now availiable at https://***/qianqianxu010/ NeurIPS2019-iSplitLBI. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

MultiFarm: A Benchmark for Multilingual Ontology Matching

SSRN

引用

SSRN 2018年

作者： Meilicke, Christian García-Castro, Raúl Freitas, Fred van Hage, Willem Robert Montiel-Ponsoda, Elena de Azevedo, Ryan Ribeiro Stuckenschmidt, Heiner Šváb-Zamazal, Ondřej Svátek, Vojtěch Tamilin, Andrei Trojahn, Cássia Wang, Shenghui Universidade Federal de Pernambuco University of Mannheim Universidad Politécnica de Madrid Web & Media Group Ontology Engineering Group Data and Web Science Group Department of Information and Knowledge Engineering Fondazione Bruno Kessler Grenoble - Rhône-Alpes VU University Amsterdam

In this paper we present the MultiFarm dataset, which has been designed as a benchmark for multilingual ontology matching. The MultiFarm dataset is composed of a set of ontologies translated in different languages and the corresponding alignments between these ontologies. It is based on the OntoFarm dataset, which has been used successfully for several years in the Ontology Alignment Evaluation Initiative (OAEI). By translating the ontologies of the OntoFarm dataset into eight different languages – Chinese, Czech, Dutch, French, German, Portuguese, Russian, and Spanish - we created a comprehensive set of realistic test cases. Based on these test cases, it is possible to evaluate and compare the performance of matching approaches with a special focus on multilingualism. © 2018, The Authors. All rights reserved.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Partitioning vectors into quadruples: Worst-case analysis of a matching-based algorithm

arXiv

引用

arXiv 2018年

作者： Ficker, Annette M.C. Erlebach, Thomas Mihalák, Matúš Spieksma, Frits C.R. Faculty of Economics and Business KU Leuven Leuven Belgium Department of Informatics University of Leicester Leicester United Kingdom Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands Department of Mathematics and Computer Science Eindhoven University of Technology Eindhoven Netherlands

Consider a problem where 4k given vectors need to be partitioned into k clusters of four vectors each. A cluster of four vectors is called a quad, and the cost of a quad is the sum of the component-wise maxima of the four vectors in the quad. The problem is to partition the given 4k vectors into k quads with minimum total cost. We analyze a straightforward matching-based algorithm, and prove that this algorithm is a 23-approximation algorithm for this problem. We further analyze the performance of this algorithm on a hierarchy of special cases of the problem, and prove that, in one particular case, the algorithm is a 54-approximation algorithm. Our analysis is tight in all cases except *** codes 68Q25 Copyright © 2018, The Authors. All rights reserved.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

The evolutionary history of 2,658 cancers (vol 578, pg 122, 2020)

引用

NATURE 2023年第7948期614卷 E42-E42页

作者： Gerstung, Moritz Jolly, Clemency Leshchiner, Ignaty Dentro, Stefan C. Gonzalez, Santiago Rosebrock, Daniel Mitchell, Thomas J. Rubanova, Yulia Anur, Pavana Yu, Kaixian Tarabichi, Maxime Deshwar, Amit Wintersinger, Jeff Kleinheinz, Kortine Vazquez-Garcia, Ignacio Haase, Kerstin Jerman, Lara Sengupta, Subhajit Macintyre, Geoff Malikic, Salem Donmez, Nilgun Livitz, Dimitri G. Cmero, Marek Demeulemeester, Jonas Schumacher, Steven Fan, Yu Yao, Xiaotong Lee, Juhee Schlesner, Matthias Boutros, Paul C. Bowtell, David D. Zhu, Hongtu Getz, Gad Imielinski, Marcin Beroukhim, Rameen Sahinalp, S. Cenk Ji, Yuan Peifer, Martin Markowetz, Florian Mustonen, Ville Yuan, Ke Wang, Wenyi Morris, Quaid D. Spellman, Paul T. Wedge, David C. Van Loo, Peter European Molecular Biology Laboratory European Bioinformatics Institute (EMBL-EBI) Cambridge UK European Molecular Biology Laboratory Genome Biology Unit Heidelberg Germany Wellcome Sanger Institute Cambridge UK Genome Biology Unit European Molecular Biology Laboratory (EMBL) Heidelberg Germany University of Ljubljana Ljubljana Slovenia The Francis Crick Institute London UK Big Data Institute University of Oxford Oxford UK Wellcome Sanger Institute Wellcome Genome Campus Hinxton UK Big Data Institute Li Ka Shing Centre University of Oxford Oxford UK University of Cambridge Cambridge UK Cambridge University Hospitals NHS Foundation Trust Cambridge UK Department of Applied Mathematics and Theoretical Physics Centre for Mathematical Sciences University of Cambridge Cambridge UK Department of Epidemiology and Biostatistics Memorial Sloan Kettering Cancer Center New York NY USA Department of Statistics Columbia University New York NY USA Department of Haematology University of Cambridge Cambridge UK University of Leuven Leuven Belgium Broad Institute of MIT and Harvard Cambridge MA USA Center for Cancer Research Massachusetts General Hospital Charlestown MA USA Department of Pathology Massachusetts General Hospital Boston MA USA Harvard Medical School Boston MA USA Center for Cancer Research Massachusetts General Hospital Boston MA USA Dana-Farber Cancer Institute Boston MA USA Department of Medical Oncology Dana-Farber Cancer Institute Boston MA USA Department of Cancer Biology Dana-Farber Cancer Institute Boston MA USA Oxford NIHR Biomedical Research Centre Oxford UK Oxford NIHR Biomedical Research Centre University of Oxford Oxford UK University of Toronto Toronto Ontario Canada Vector Institute Toronto Ontario Canada Vector Institute Toronto ON Canada Department of Computer Science University of Toronto Toronto ON Canada Ontario Institute for Cancer Research Toronto Ontario Canada University of California Los Angeles

来源：评论

学校读者我要写书评

暂无评论

Aggregation Signature for Small Object Tracking

arXiv

引用

arXiv 2019年

作者： Liu, Chunlei Ding, Wenrui Yang, Jinyu Murino, Vittorio Zhang, Baochang Han, Jungong Guo, Guodong School of Electrical and Information Engineering Beihang University Beijing China Unmanned System Research Institute Beihang University Beijing China School of Computer Science University of Birmingham British United Kingdom University of Verona Verona Italy Pattern Analysis and Computer Vision department Istituto Italiano di Tecnologia Genoa Italy School of Automation Science and Electrical Engineering Beihang University Beijing China Shenzhen Academy of Aerospace Technology Shenzhen China WMG Data Science Group University of Warwick CoventryCV4 7AL United Kingdom Institute of Deep Learning Baidu Research and National Engineering Laboratory for Deep Learning Technology and Application

—Small object tracking becomes an increasingly important task, which however has been largely unexplored in computer vision. The great challenges stem from the facts that: 1) small objects show extreme vague and variable appearances, and 2) they tend to be lost easier as compared to normal-sized ones due to the shaking of lens. In this paper, we propose a novel aggregation signature suitable for small object tracking, especially aiming for the challenge of sudden and large drift. We make three-fold contributions in this work. First, technically, we propose a new descriptor, named aggregation signature, based on saliency, able to represent highly distinctive features for small objects. Second, theoretically, we prove that the proposed signature matches the foreground object more accurately with a high probability. Third, experimentally, the aggregation signature achieves a high performance on multiple datasets, outperforming the state-of-the-art methods by large margins. Moreover, we contribute with two newly collected benchmark datasets, i.e., small90 and small112, for visually small object tracking. The datasets will be available in https://***/bczhangbczhang/. Copyright © 2019, The Authors. All rights reserved.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：