Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Data Science, Learning by Latent Structures, and Knowledge Discovery > Edge Selection in a Noisy Graph by Concept Analysis: Application to a Genomic Network

Data Science, Learning by Latent Structures, and Knowledge Discovery |
Springer Berlin Heidelberg
Data Science, Learning by Latent Structures, and Knowledge Discovery

Edge Selection in a Noisy Graph by Concept Analysis: Application to a Genomic Network
Authors

ARI Id

1664513281950_1999270

Access

Not Available Free

Pages

353-364

DOI

10.1007/978-3-662-44983-7_31

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-662-44983-7_31

Loading...
Table of Contents of Book
Chapters/HeadingsAuthor(s)PagesInfo
Loading...
Chapters/HeadingsAuthor(s)PagesInfo
Similar Books
Loading...
Similar Chapters
Loading...
Similar Thesis
Loading...

Similar News

Loading...
Similar Articles
Loading...
Similar Article Headings
Loading...