Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Mandar S. Chaudhary"'
Publikováno v:
Bioinformatics. 37:2521-2528
Motivation Identifying meaningful cancer driver genes in a cohort of tumors is a challenging task in cancer genomics. Although existing studies have identified known cancer drivers, most of them focus on detecting coding drivers with mutations. It is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3033aaa26aef0562cb7f4de5b754b40d
https://doi.org/10.1093/bioinformatics/btab145
https://doi.org/10.1093/bioinformatics/btab145
Publikováno v:
Complex Networks & Their Applications VI ISBN: 9783319721491
COMPLEX NETWORKS
COMPLEX NETWORKS
Mining outliers in graph data is a rapidly growing area of research. Traditional methods focus either on static graphs, or restrict relationships to be pairwise. In this work we address both of these limitations directly, and propose the first approa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4467b0a5f3472a480c356f5b12c96343
https://doi.org/10.1007/978-3-319-72150-7_9
https://doi.org/10.1007/978-3-319-72150-7_9
Publikováno v:
Complex Networks & Their Applications VI ISBN: 9783319721491
COMPLEX NETWORKS
COMPLEX NETWORKS
Constraint-based (CB) methods are widely used for discovering causal relationships in observational data. The PC-stable algorithm is a prominent example of CB methods. A critical component of the PC-stable algorithm is to find d-separators and perfor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3db0555af3fdd8d21cdea069b0629d7d
https://doi.org/10.1007/978-3-319-72150-7_21
https://doi.org/10.1007/978-3-319-72150-7_21
Publikováno v:
SSDBM
Detecting all communities in a single graph is a prevalent task in graph data analytics. However, many scientific applications naturally create data as an ensemble of graphs. For example, graph ensembles can be created from multiple: social networks
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cacd923e8bd3922354fa5b09a7a2e283
https://doi.org/10.1145/3085504.3085532
https://doi.org/10.1145/3085504.3085532
Autor:
Fredrick H. M. Semazzi, Dhara Desai, P. Murali Doraiswamy, Nagiza F. Samatova, Michael P. Angus, Vipin Kumar, Mandar S. Chaudhary, Gonzalo A. Bello, Steve Harenberg, Doel L. Gonzalez
Publikováno v:
Advanced Data Mining and Applications ISBN: 9783319495859
ADMA
ADMA
Identifying meaningful features that drive a phenomenon (response) of interest in complex systems of interconnected factors is a challenging problem. Causal discovery methods have been previously applied to estimate bounds on causal strengths of fact
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4cfa97da6055dfa57dd0cb904102202
https://doi.org/10.1007/978-3-319-49586-6_26
https://doi.org/10.1007/978-3-319-49586-6_26
Publikováno v:
2012 Third International Conference on Emerging Applications of Information Technology.
An attempt has been made to recognize similar looking printed Gujarati characters. It has been assumed that similar looking character recognition is the main challenge for an OCR to work efficiently. The dimensionality of the character images is dras
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f9355270a0d24c945f7a6459f9461cc
https://doi.org/10.1109/eait.2012.6407884
https://doi.org/10.1109/eait.2012.6407884