skip to main content
Visitante
Meu Espaço
Minha Conta
Sair
Identificação
This feature requires javascript
Tags
Revistas Eletrônicas (eJournals)
Livros Eletrônicos (eBooks)
Bases de Dados
Bibliotecas USP
Ajuda
Ajuda
Idioma:
Inglês
Espanhol
Português
This feature required javascript
This feature requires javascript
Primo Search
Busca Geral
Busca Geral
Acervo Físico
Acervo Físico
Produção Intelectual da USP
Produção USP
Search For:
Clear Search Box
Search in:
Busca Geral
Or select another collection:
Search in:
Busca Geral
Busca Avançada
Busca por Índices
This feature requires javascript
This feature requires javascript
Estimation of sparse directed acyclic graphs for multivariate counts data
Han, Sung Won ; Zhong, Hua
Biometrics, 2016-09, Vol.72 (3), p.791-803
[Periódico revisado por pares]
United States: Blackwell Publishing Ltd
Texto completo disponível
Citações
Citado por
Exibir Online
Detalhes
Resenhas & Tags
Mais Opções
Nº de Citações
This feature requires javascript
Enviar para
Adicionar ao Meu Espaço
Remover do Meu Espaço
E-mail (máximo 30 registros por vez)
Imprimir
Link permanente
Referência
EasyBib
EndNote
RefWorks
del.icio.us
Exportar RIS
Exportar BibTeX
This feature requires javascript
Título:
Estimation of sparse directed acyclic graphs for multivariate counts data
Autor:
Han, Sung Won
;
Zhong, Hua
Assuntos:
Algorithms
;
Bayesian network
;
BIOMETRIC METHODOLOGY
;
Computer Simulation
;
Count data
;
Directed acyclic graph
;
Economic models
;
Female
;
Gene Regulatory Networks
;
Genetic transformation
;
Graph theory
;
Graphs
;
High-Throughput Nucleotide Sequencing
;
Humans
;
Lasso estimation
;
Likelihood Functions
;
Models, Statistical
;
Multivariate analysis
;
Next-generation sequencing
;
Normal distribution
;
Ovarian cancer
;
Ovarian Neoplasms - genetics
;
Penalized likelihood estimation
;
Poisson Distribution
;
Search algorithms
;
Unknown variable ordering
É parte de:
Biometrics, 2016-09, Vol.72 (3), p.791-803
Notas:
ArticleID:BIOM12467
istex:879F636A39D82F576BF6E712E2A55BC4834F9BA0
ark:/67375/WNG-ZJ2DM3SN-D
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
Descrição:
The next-generation sequencing data, called high-throughput sequencing data, are recorded as count data, which are generally far from normal distribution. Under the assumption that the count data follow the Poisson log-normal distribution, this article provides an L₁-penalized likelihood framework and an efficient search algorithm to estimate the structure of sparse directed acyclic graphs (DAGs) for multivariate counts data. In searching for the solution, we use iterative optimization procedures to estimate the adjacency matrix and the variance matrix of the latent variables. The simulation result shows that our proposed method outperforms the approach which assumes multivariate normal distributions, and the log-transformat ion approach. It also shows that the proposed method outperforms the rank-based PC method under sparse network or hub network structures. As a real data example, we demonstrate the efficiency of the proposed method in estimating the gene regulatory networks of the ovarian cancer study.
Editor:
United States: Blackwell Publishing Ltd
Idioma:
Inglês;Francês
Links
View this record in MEDLINE/PubMed
This feature requires javascript
This feature requires javascript
Voltar para lista de resultados
This feature requires javascript
This feature requires javascript
Buscando em bases de dados remotas. Favor aguardar.
Buscando por
em
scope:(USP_PRODUCAO),scope:(USP_EBOOKS),scope:("PRIMO"),scope:(USP),scope:(USP_EREVISTAS),scope:(USP_FISICO),primo_central_multiple_fe
Mostrar o que foi encontrado até o momento
This feature requires javascript
This feature requires javascript