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.
Timeline
Mendeley readers
Chapter title |
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
|
---|---|
Chapter number | 65 |
Book title |
Computational Logic — CL 2000
|
Published by |
Springer, Berlin, Heidelberg, January 2000
|
DOI | 10.1007/3-540-44957-4_65 |
Book ISBNs |
978-3-54-067797-0, 978-3-54-044957-7
|
Authors |
Yves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme, Lotfi Lakhal |
Mendeley readers
The data shown below were compiled from readership statistics for 56 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Japan | 1 | 2% |
India | 1 | 2% |
France | 1 | 2% |
Unknown | 53 | 95% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 17 | 30% |
Researcher | 9 | 16% |
Student > Master | 9 | 16% |
Student > Doctoral Student | 4 | 7% |
Student > Bachelor | 3 | 5% |
Other | 10 | 18% |
Unknown | 4 | 7% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 40 | 71% |
Engineering | 2 | 4% |
Medicine and Dentistry | 2 | 4% |
Mathematics | 1 | 2% |
Economics, Econometrics and Finance | 1 | 2% |
Other | 3 | 5% |
Unknown | 7 | 13% |