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

IEEE International Conference on Big data

作者： Aakash Deep Singh Wei Wu Shili Xiang Shonali Krishnaswamy Department of Mathematics and Computing Indian Institute of Technology Delhi Data Analytics Department Institute for Infocomm Research

Trip time prediction is an important problem. Taxi passengers often want to know when they will arrive at their destinations. We design a method of predicting taxi trip time by finding historical similar trips. Trips are clustered based on origin, destination, and start time. Then similar trips are mapped to road networks to find frequent sub-trajectories that are used to model travel time of the various parts of the routes. Experimental results show this method is effective.

关键词： Trajectory Clustering algorithms Public transportation Global Positioning System Roads Predictive models

来源：评论

学校读者我要写书评

暂无评论

The adaptable buffer algorithm for high quantile estimation in non-stationary data streams

The adaptable buffer algorithm for high quantile estimation ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Ognjen Arandjelović Duc-Son Pham Svetha Venkatesh Centre for Pattern Recognition & Data Analytics Deakin University Geelong VIC Australia Department of Computing Curtin University Perth WA Australia

The need to estimate a particular quantile of a distribution is an important problem which frequently arises in many computer vision and signal processing applications. For example, our work was motivated by the requirements of many semi-automatic surveillance analytics systems which detect abnormalities in close-circuit television (CCTV) footage using statistical models of low-level motion features. In this paper we specifically address the problem of estimating the running quantile of a data stream with non-stationary stochasticity when the memory for storing observations is limited. We make several major contributions: (i) we derive an important theoretical result which shows that the change in the quantile of a stream is constrained regardless of the stochastic properties of data, (ii) we describe a set of high-level design goals for an effective estimation algorithm that emerge as a consequence of our theoretical findings, (iii) we introduce a novel algorithm which implements the aforementioned design goals by retaining a sample of data values in a manner adaptive to changes in the distribution of data and progressively narrowing down its focus in the periods of quasi-stationary stochasticity, and (iv) we present a comprehensive evaluation of the proposed algorithm and compare it with the existing methods in the literature on both synthetic data sets and three large `real-world' streams acquired in the course of operation of an existing commercial surveillance system. Our findings convincingly demonstrate that the proposed method is highly successful and vastly outperforms the existing alternatives, especially when the target quantile is high valued and the available buffer capacity severely limited.

关键词： Australia Indexes Entropy

来源：评论

学校读者我要写书评

暂无评论

A Configurable Deep Network for High-Dimensional Clinical Trial data

A Configurable Deep Network for High-Dimensional Clinical Tr...

引用

International Joint Conference on Neural Networks

作者： Jim O' Donoghue Mark Roantree Martin Van Boxtel Insight Centre for Data Analytics School of Computing Dublin City University Glasnevin Dublin 9 Department of Psychiatry and Neuropsychology School for Mental Health and Neuroscience Maastricht University Netherlands

ISBN: (纸本)9781479919611

Clinical studies provide interesting case studies for data mining researchers, given the often high degree of dimensionality and long term nature of these studies. In areas such as dementia, accurate predictions from data scientists provide vital input into the understanding of how certain features (representing lifestyle) can predict outcomes such as dementia. Most research involved has used traditional or shallow data mining approaches which have been shown to offer varying degrees of accuracy in datasets with high dimensionality. In this research, we explore the use of deep learning architectures, as they have been shown to have high predictive capabilities in image and audio datasets. The purpose of our research is to build a framework which allows easy reconfiguration for the performance of experiments across a number of deep learning approaches. In this paper, we present our framework for a configurable deep learning machine and our evaluation and analysis of two shallow approaches: regression and multi-layer perceptron, as a platform to a deep belief network, and using a dataset created over the course of 12 years by researchers in the area of dementia.

关键词： Configurable Deep Network High-Dimensional Clinical Trial data audio datasets dataset configurability Bayesian networks Dementia data mining Frameworks Clinical Study Clinical Trial Life Style

来源：评论

学校读者我要写书评

暂无评论

Identifying the best machine learning algorithms for brain tumor segmentation, progression assessment, and overall survival prediction in the BRATS challenge

arXiv

引用

arXiv 2018年

作者： Bakas, Spyridon Reyes, Mauricio Jakab, Andras Bauer, Stefan Rempfler, Markus Crimi, Alessandro Shinohara, Russell Takeshi Berger, Christoph Ha, Sung Min Rozycki, Martin Prastawa, Marcel Alberts, Esther Lipkova, Jana Freymann, John Kirby, Justin Bilello, Michel Fathallah-Shaykh, Hassan M. Wiest, Roland Kirschke, Jan Wiestler, Benedikt Colen, Rivka Kotrotsou, Aikaterini Lamontagne, Pamela Marcus, Daniel Milchenko, Mikhail Nazeri, Arash Weber, Marc-Andr Mahajan, Abhishek Baid, Ujjwal Gerstner, Elizabeth Kwon, Dongjin Acharya, Gagan Agarwal, Manu Alam, Mahbubul Albiol, Alberto Albiol, Antonio Albiol, Francisco J. Alex, Varghese Allinson, Nigel Amorim, Pedro H.A. Amrutkar, Abhijit Anand, Ganesh Andermatt, Simon Arbel, Tal Arbelaez, Pablo Avery, Aaron Azmat, Muneeza Pranjal, B. Bai, Wenjia Banerjee, Subhashis Barth, Bill Batchelder, Thomas Batmanghelich, Kayhan Battistella, Enzo Beers, Andrew Belyaev, Mikhail Bendszus, Martin Benson, Eze Bernal, Jose Bharath, Halandur Nagaraja Biros, George Bisdas, Sotirios Brown, James Cabezas, Mariano Cao, Shilei Cardoso, Jorge M. Carver, Eric N. Casamitjana, Adri Castillo, Laura Silvana Cat, Marcel Cattin, Philippe Cérigues, Albert Chagas, Vinicius S. Chandra, Siddhartha Chang, Yi-Ju Chang, Shiyu Chang, Ken Chazalon, Joseph Chen, Shengcong Chen, Wei Chen, Jefferson W. Chen, Zhaolin Cheng, Kun Choudhury, Ahana Roy Chylla, Roger Clrigues, Albert Colleman, Steven Colmeiro, Ramiro German Rodriguez Combalia, Marc Costa, Anthony Cui, Xiaomeng Dai, Zhenzhen Dai, Lutao Daza, Laura Alexandra Deutsch, Eric Ding, Changxing Dong, Chao Dong, Shidu Dudzik, Wojciech Eaton-Rosen, Zach Egan, Gary Escudero, Guilherme Estienne, Tho Everson, Richard Fabrizio, Jonathan Fan, Yong Fang, Longwei Feng, Xue Ferrante, Enzo Fidon, Lucas Fischer, Martin French, Andrew P. Fridman, Naomi Fu, Huan Fuentes, David Gao, Yaozong Gates, Evan Gering, David Gholami, Amir Gierke, Willi Glocker, Ben Gong, Mingming Gonzlez-Vill, Sandra Grosges, T. Guan, Yuanfang Guo, Sheng Gupta, Sudeep Han, Woo-Sup Han, Il Song Harmuth, Ko Center for Biomedical Image Computing and Analytics University of Pennsylvania PhiladelphiaPA United States Department of Radiology Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Institute for Surgical Technology and Biomechanics University of Bern Bern Switzerland Center for MR-Research University Children's Hospital Zurich Zurich Switzerland Support Centre for Advanced Neuroimaging Inselspital Institute for Diagnostic and Interventional Neuroradiology Bern University Hospital Bern Switzerland University Hospital of Zurich Zurich Switzerland Center for Clinical Epidemiology and Biostatistics University of Pennsylvania Philadelphia United States Image-Based Biomedical Modeling Group Technical University of Munich Munich Germany Icahn School of Medicine Mount Sinai Health System New YorkNY United States Leidos Biomedical Research Inc. Frederick National Laboratory for Cancer Research FrederickMD21701 United States Cancer Imaging Program National Cancer Institute National Institutes of Health BethesdaMD20814 United States Department of Neurology University of Alabama at Birmingham BirminghamAL United States Department of Diagnostic Radiology University of Texas MD Anderson Cancer Center HoustonTX United States Department of Psychology Washington University St. LouisMO United States Neuroimaging Informatics and Analysis Center Washington University St. LouisMO United States Department of Radiology Washington University St. LouisMO United States Institute of Diagnostic and Interventional Radiology Pediatric Radiology and Neuroradiology University Medical Center Rostock Ernst-Heydemann-Str. 6 Rostock18057 Germany Tata Memorial Centre Homi Bhabha National Institute Mumbai India Shri Guru Gobind Singhji Institute of Engineering and Technology Nanded India NVIDIA Santa Clara

Gliomas are the most common primary brain malignancies, with different degrees of aggressiveness, variable prognosis and various heterogeneous histologic sub-regions, i.e., peritumoral edematous/invaded tissue, necrotic core, active and non-enhancing core. This intrinsic heterogeneity is also portrayed in their radio-phenotype, as their sub-regions are depicted by varying intensity profiles disseminated across multi-parametric magnetic resonance imaging (mpMRI) scans, reflecting varying biological properties. Their heterogeneous shape, extent, and location are some of the factors that make these tumors difficult to resect, and in some cases inoperable. The amount of resected tumor is a factor also considered in longitudinal scans, when evaluating the apparent tumor for potential diagnosis of progression. Furthermore, there is mounting evidence that accurate segmentation of the various tumor sub-regions can offer the basis for quantitative image analysis towards prediction of patient overall survival. This study assesses the state-of-the-art machine learning (ML) methods used for brain tumor image analysis in mpMRI scans, during the last seven instances of the International Brain Tumor Segmentation (BraTS) challenge, i.e., 2012-2018. Specifically, we focus on i) evaluating segmentations of the various glioma sub-regions in pre-operative mpMRI scans, ii) assessing potential tumor progression by virtue of longitudinal growth of tumor sub-regions, beyond use of the RECIST/RANO criteria, and iii) predicting the overall survival from pre-operative mpMRI scans of patients that underwent gross total resection. Finally, we investigate the challenge of identifying the best ML algorithms for each of these tasks, considering that apart from being diverse on each instance of the challenge, the multi-institutional mpMRI BraTS dataset has also been a continuously evolving/growing dataset. Copyright © 2018, The Authors. All rights reserved.

关键词： Tumors

来源：评论

学校读者我要写书评

暂无评论

Sparse Online Relative Similarity Learning

Sparse Online Relative Similarity Learning

引用

IEEE International Conference on data Mining (ICDM)

作者： Dezhong Yao Peilin Zhao Chen Yu Hai Jin Bin Li Services Computing Technology and System Lab Huazhong University of Science and Technology Wuhan China Data Analytics Department Institute for Infocomm Research Singapore Economics and Management School Wuhan University Wuhan China

ISBN: (纸本)9781467395052

For many data mining and machine learning tasks, the quality of a similarity measure is the key for their performance. To automatically find a good similarity measure from datasets, metric learning and similarity learning are proposed and studied extensively. Metric learning will learn a Mahalanobis distance based on positive semi-definite (PSD) matrix, to measure the distances between objectives, while similarity learning aims to directly learn a similarity function without PSD constraint so that it is more attractive. Most of the existing similarity learning algorithms are online similarity learning method, since online learning is more scalable than offline learning. However, most existing online similarity learning algorithms learn a full matrix with d 2 parameters, where d is the dimension of the instances. This is clearly inefficient for high dimensional tasks due to its high memory and computational complexity. To solve this issue, we introduce several Sparse Online Relative Similarity (SORS) learning algorithms, which learn a sparse model during the learning process, so that the memory and computational cost can be significantly reduced. We theoretically analyze the proposed algorithms, and evaluate them on some real-world high dimensional datasets. Encouraging empirical results demonstrate the advantages of our approach in terms of efficiency and efficacy.

关键词： Measurement Sparse matrices Image retrieval Machine learning algorithms Algorithm design and analysis data mining Correlation

来源：评论

学校读者我要写书评

暂无评论

Utilizing purchase intervals in latent clusters for product recommendation 8

Utilizing purchase intervals in latent clusters for product ...

引用

8th Workshop on Social Network Mining and Analysis, SNAKDD 2014

作者： Zhao, Gang Lee, Mong Li Wynne, Hsu School of Computing National University of Singapore Singapore Singapore Data Analytics Department Institute for Infocomm Research Singapore Singapore

ISBN: (纸本)1595930361

Collaborative filtering have become increasingly important with the development of Web 2.0. Online shopping service providers aim to provide users with quality list of recommended items that will enhance user satisfaction and loyalty. Matrix factorization approaches have become the dominant method as they can reduce the dimension of the data set and alleviate the sparsity problem. However, matrix factorization approaches are limited because they depict each user as one preference vector. In practice, we observe that users may have different preferences when purchasing different subsets of items, and the periods between purchases also vary from one user to another. In this work, we propose a probabilistic approach to learn latent clusters in the large user-item matrix, and incorporate temporal information into the recommendation process. Experimental results on a real world dataset demonstrate that our approach significantly improves the conversion rate, precision and recall of state-of-the-art methods. Copyright 2014 ACM.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

11th German Conference on Chemoinformatics (GCC 2015) Abstracts

引用

JOURNAL OF CHEMINFORMATICS 2016年第SUPPL 1期8卷 1-27页

作者： [Anonymous] GDCh-CIC Division Associated Board Member Beilstein-Institut zur Förderung der Chemischen Wissenschaften Trakehner Str. 7-9 60487 Frankfurt Germany. ufechner@beilstein-institut.de. Division Medicinal Chemistry Amsterdam Institute for Molecules Medicines and Systems (AIMMS) VU University Amsterdam The Netherlands. Centre for Bioinformatics Uni Hamburg Bundesstr. 43 20146 Hamburg Germany. Sanofi-Aventis Deutschland GmbH 65926 Frankfurt am Main Germany. stefan.guessregen@***. Sanofi-Aventis Deutschland GmbH 65926 Frankfurt am Main Germany. GlaxoSmithKline Stevenage SG1 2NY UK. nicola.j.richmond@***. Discngine Paris 75011 France. Organisch-Chemisches Institut Westfälische Wilhelms-Universität Münster Germany. marwin.segler@wwu.de. Organisch-Chemisches Institut Westfälische Wilhelms-Universität Münster Germany. Bundeskriminalamt Wiesbaden Central Analytics II 65173 Wiesbaden Germany. Department of Chemistry and Biochemistry University of California Santa Barbara CA 93111 USA. shea@chem.ucsb.edu. Department of Chemistry and Biochemistry University of California Santa Barbara CA 93111 USA. Chemistry Department Ludwig-Maximilians-Universität München Butenandtstr. 7 81377 Munich Germany. Inorganic Chemistry and Center for Nanointegration University of Duisburg-Essen Essen Germany. CAM-D Technologies Essen Germany. Institute for Bioinformatics and Chemoinformatics Westphalian University of Applied Sciences Recklinghausen Germany. Institute for Bioinformatics and Chemoinformatics Westphalian University of Applied Sciences Recklinghausen Germany. achim.zielesny@w-hs.de. Leiden University Leiden Netherlands. j.fraaije@chem.leidenuniv.nl. Culgi BV Berlin Germany. Physikalische Chemie III TU Dortmund 44227 Dortmund Germany. stefan.kast@tu-dortmund.de. Centre for Molecular Informatics Department of Chemistry University of Cambridge Lensfield Road Cambridge CB2 1EW United Kingdom. kcb27@cam.ac.uk. Centre for Molecular Informatics Department of Chemistry

来源：评论

学校读者我要写书评

暂无评论

Highlights from the 11th ISCB Student Council Symposium 2015. Dublin, Ireland. 10 July 2015

引用

BMC bioinformatics 2016年第3期17 Suppl 3卷 95页

作者： Katie Wilkins Mehedi Hassan Margherita Francescatto Jakob Jespersen R. Gonzalo Parra Bart Cuypers Dan DeBlasio Alexander Junge Anupama Jigisha Farzana Rahman Griet Laenen Sander Willems Lieven Thorrez Yves Moreau Nagarajan Raju Sonia Pankaj Chothani C. Ramakrishnan Masakazu Sekijima M. Michael Gromiha Paddy J Slator Nigel J Burroughs Przemysław Szałaj Zhonghui Tang Paul Michalski Oskar Luo Xingwang Li Yijun Ruan Dariusz Plewczynski Giulia Fiscon Emanuel Weitschek Massimo Ciccozzi Paola Bertolazzi Giovanni Felici Pieter Meysman Manu Vanaerschot Maya Berg Hideo Imamura Jean-Claude Dujardin Kris Laukens Westa Domanova James R. Krycer Rima Chaudhuri Pengyi Yang Fatemeh Vafaee Daniel J. Fazakerley Sean J. Humphrey David E. James Zdenka Kuncic Plant Pathology and Plant-Microbe Biology Section School of Integrative Plant Science Cornell University Ithaca USA Graduate Field of Computational Biology Cornell University Ithaca USA School of Computing & Mathematics University of South Wales Cardiff UK Department of Genome Biology for Neurodegenerative Diseases German Center for Neurodegenerative Diseases (DZNE) within the Helmholtz Association ᅟ Germany Department of Surgery Massachusetts General Hospital The Broad Institute of MIT and Harvard Boston USA Department of Systems Biology Technical University of Denmark Kemitorvet Denmark Protein Physiology Lab Facultad de Ciencias Exactas y Naturales Universidad de Buenos Aires Buenos Aires Argentina Molecular Parasitology Unit (MPU) Institute of Tropical Medicine Antwerp Belgium Advanced Database Research and Modeling (ADReM) research group University of Antwerp Antwerpen Belgium Department of Computer Science University of Arizona Tucson USA Department of Veterinary Clinical and Animal Sciences Center for non-coding RNA in Technology and Health University of Copenhagen Copenhagen Denmark University College Dublin Dublin Ireland Department of Electrical Engineering (ESAT) STADIUS Center for Dynamical Systems Signal Processing and Data Analytics KU Leuven Leuven Belgium Minds Medical IT Department Leuven Belgium Scientific Institute of Public Health (WIV-ISP) Platform of Biotechnology and Molecular Biology (PBB) Brussels Belgium Department of Development and Regeneration @ Kulak KU Leuven Kortrijk Belgium Department of Biotechnology Bhupat and Jyoti Metha School of Biosciences Indian Institute of Technology Madras Chennai India Philips Research North America Briarcliff Manor USA Global Scientific Information and Computing Center (GSIC) Tokyo Institute of Technology Tokyo Japan Systems Biology Centre University of Warwick Senate House Coventry UK Systems Biology Doctoral Training Centre University of Warwick Senate House Coventry UK Center for B

A1 Highlights from the eleventh ISCB Student Council Symposium 2015 Katie Wilkins, Mehedi Hassan, Margherita Francescatto, Jakob Jespersen, R. Gonzalo Parra, Bart Cuypers, Dan DeBlasio, Alexander Junge, Anupama Jigisha, Farzana Rahman O1 Prioritizing a drug’s targets using both gene expression and structural similarity Griet Laenen, Sander Willems, Lieven Thorrez, Yves Moreau O2 Organism specific protein-RNA recognition: A computational analysis of protein-RNA complex structures from different organisms Nagarajan Raju, Sonia Pankaj Chothani, C. Ramakrishnan, Masakazu Sekijima; M. Michael Gromiha O3 Detection of Heterogeneity in Single Particle Tracking Trajectories Paddy J Slator, Nigel J Burroughs O4 3D-NOME: 3D NucleOme Multiscale Engine for data-driven modeling of three-dimensional genome architecture Przemysław Szałaj, Zhonghui Tang, Paul Michalski, Oskar Luo, Xingwang Li, Yijun Ruan, Dariusz Plewczynski O5 A novel feature selection method to extract multiple adjacent solutions for viral genomic sequences classification Giulia Fiscon, Emanuel Weitschek, Massimo Ciccozzi, Paola Bertolazzi, Giovanni Felici O6 A Systems Biology Compendium for Leishmania donovani Bart Cuypers, Pieter Meysman, Manu Vanaerschot, Maya Berg, Hideo Imamura, Jean-Claude Dujardin, Kris Laukens O7 Unravelling signal coordination from large scale phosphorylation kinetic data Westa Domanova, James R. Krycer, Rima Chaudhuri, Pengyi Yang, Fatemeh Vafaee, Daniel J. Fazakerley, Sean J. Humphrey, David E. James, Zdenka Kuncic

关键词： Visceral Leishmaniasis Feature Selection Method Frequent Itemset Mining Leishmania Donovani Student Council

来源：评论

学校读者我要写书评

暂无评论

Novel SNP improves differential survivability and mortality in non-small cell lung cancer patients

引用

BMC Genomics 2014年第9期15卷 1-7页

作者： Mah, Tzia Liang Yap, Xin Ning Adeline Limviphuvadh, Vachiranee Li, Nanpu Sridharan, Srinath Kuralmani, Vellaisemy Feng, Mengling Liem, Natalia Adhikari, Sharmila Yong, Wei Peng Soo, Ross A Maurer-Stroh, Sebastian Eisenhaber, Frank Tong, Joo Chuan Institute for Infocomm Research Data Analytics Department 1 Fusionopolis Way #21-01 Connexis South Tower Singapore 138632 Singapore National University Health System Department of Haematology-Oncology 5 Lower Kent Ridge Road Singapore 119074 Singapore Bioinformatics Institute 30 Biopolis Street #07-01 Matrix Singapore 138671 Singapore Nanyang Technological University (NTU) School of Biological Sciences (SBS) 60 Nanyang Drive 637551 Singapore Nanyang Technological University (NTU) School of Computer Engineering (SCE) 50 Nanyang Drive 637553 Singapore National University of Singapore (NUS) Department of Biological Sciences (DBS) 8 Medical Drive 4 117597 Singapore National University of Singapore Department of Biochemistry Yong Loo Lin School of Medicine Singapore 117597 Singapore Institute of High Performance Computing 1 Fusionopolis Way #16-16 Connexis 138632 Singapore National University of Singapore Cancer Science Institute of Singapore Singapore

Background: Non-small cell lung cancer (NSCLC) is a major cause of cancer-related death worldwide due to poor patient prognosis and clinical outcome. Here, we studied the genetic variations underlying NSCLC pathogenesis based on their association to patient outcome after gemcitabine therapy. Results: Bioinformatics analysis was used to investigate possible effects of POLA2 G583R (POLA2+1747 GG/GA, dbSNP ID: rs487989) in terms of protein function. Using biostatistics, POLA2+1747 GG/GA (rs487989, POLA2 G583R) was identified as strongly associated with mortality rate and survival time among NSCLC patients. It was also shown that POLA2+1747 GG/GA is functionally significant for protein localization via green fluorescent protein (GFP)-tagging and confocal laser scanning microscopy analysis. The single nucleotide polymorphism (SNP) causes DNA polymerase alpha subunit B to localize in the cytoplasm instead of the nucleus. This inhibits DNA replication in cancer cells and confers a protective effect in individuals with this SNP. Conclusions: The results suggest that POLA2+1747 GG/GA may be used as a prognostic biomarker of patient outcome in NSCLC pathogenesis. © 2014 Mah et al.;licensee BioMed Central Ltd.

关键词： Biomarker Genetic variant Mortality Non-small cell lung cancer Survival Outcome

来源：评论

学校读者我要写书评

暂无评论

An integrated framework for suicide risk prediction 13

An integrated framework for suicide risk prediction

引用

19th ACM SIGKDD International Conference on Knowledge Discovery and data Mining, KDD 2013

作者： Trany, Truyen Phung, Dinh Luo, Wei Harvey, Richard Berk, Michael Venkatesh, Svetha Pattern Recognition and Data Analytics Deakin University Australia Department of Computing Curtin University Australia Mental Health Drugs and Alcohol Barwon HealthVIC Australia School of Medicine Deakin University Australia

ISBN: (纸本)9781450321747

Suicide is a major concern in society. Despite of great attention paid by the community with very substantive medico-legal implications, there has been no satisfying method that can reliably predict the future attempted or completed suicide. We present an integrated machine learning framework to tackle this challenge. Our proposed framework consists of a novel feature extraction scheme, an embedded feature selection process, a set of risk classifiers and finally, a risk calibration procedure. For temporal feature extraction, we cast the patient's clinical history into a temporal image to which a bank of one-side filters are applied. The responses are then partly transformed into mid-level features and then selected in 1-norm framework under the extreme value theory. A set of probabilistic ordinal risk classifiers are then applied to compute the risk probabilities and further re-rank the features. Finally, the predicted risks are calibrated. Together with our Australian partner, we perform comprehensive study on data collected for the mental health cohort, and the experiments validate that our proposed framework outperforms risk assessment instruments by medical practitioners. Copyright © 2013 ACM.

关键词： Filter banks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：