You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
Mining Frequent Connected Subgraphs Reducing the Number of Candidates
|
---|---|
Chapter number | 42 |
Book title |
Machine Learning and Knowledge Discovery in Databases
|
Published by |
Springer, Berlin, Heidelberg, September 2008
|
DOI | 10.1007/978-3-540-87479-9_42 |
Book ISBNs |
978-3-54-087478-2, 978-3-54-087479-9
|
Authors |
Andrés Gago Alonso, José Eladio Medina Pagola, Jesús Ariel Carrasco-Ochoa, José Fco. Martínez-Trinidad, Gago Alonso, Andrés, Medina Pagola, José Eladio, Carrasco-Ochoa, Jesús Ariel, Martínez-Trinidad, José Fco. |
Mendeley readers
The data shown below were compiled from readership statistics for 10 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Belgium | 1 | 10% |
Unknown | 9 | 90% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 3 | 30% |
Researcher | 2 | 20% |
Student > Ph. D. Student | 2 | 20% |
Student > Doctoral Student | 1 | 10% |
Other | 1 | 10% |
Other | 0 | 0% |
Unknown | 1 | 10% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 7 | 70% |
Chemistry | 1 | 10% |
Unknown | 2 | 20% |