The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Text summarization using unsupervised deep learning
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270 · cited 1×
“Bernoulli-Bernoulli units) and as an energy-based network, the energy function (Hopfield, 1982) is bilinear:”
BackgroundA fast learning algorithm for deep belief nets
Hinton, G. E., Osindero, S., & Teh, Y.-W. (2006) · Neural Computation · doi:10.1162/neco.2006.18.7.1527 · Cited by 16,336
Distilling the Knowledge in a Neural Network
Hinton, G., Vinyals, O., & Dean, J. (2015) · arXiv · doi:10.48550/arxiv.1503.02531 · Cited by 14,204
Learning Deep Architectures for AI
Bengio, Y. (2009) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000006 · Cited by 9,239
An algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096 · cited 1×
“Stemming using Porter (1980) and stop-word removal 1 reduces this to 46,603 words comprising 7478 unique words.”
MethodExtracting and composing robust features with denoising autoencoders
Vincent, P., Larochelle, H., Bengio, Y., & Manzagol, P.-A. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390294 · Cited by 7,436
Training Products of Experts by Minimizing Contrastive Divergence
Hinton, G. E. (2002) · Neural Computation · doi:10.1162/089976602760128018 · Cited by 4,879 · cited 3×
“Carreira-Perpinan and Hinton (2005) numerically compared the update rule with exact log-likelihood gradient with CD-k (Hinton, 2002).”
BackgroundResultHansen, L. K., & Salamon, P. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.58871 · Cited by 4,260
A Practical Guide to Training Restricted Boltzmann Machines
Hinton, G. E. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8_32 · Cited by 2,852
Learning to rank using gradient descent
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102363 · Cited by 2,836
Practical Recommendations for Gradient-Based Training of Deep Architectures
Bengio, Y. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8_26 · Cited by 2,259
Neural Networks: Tricks of the Trade: Second Edition
(2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8 · Cited by 2,116
Buciluǎ, C., Caruana, R., & Niculescu-Mizil, A. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150464 · Cited by 2,068
Salakhutdinov, R., & Hinton, G. (2009) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2008.11.006 · Cited by 1,246 · cited 1×
“AEs with pre-training have been successfully applied primarily to documents retrieval (Salakhutdinov and Hinton, 2009; Genest et al., 2011).”
MethodThe Pyramid Method: Incorporating human content selection variation in summarization evaluation
Nenkova, A., Passonneau, R., & McKeown, K. (2007) · ACM Transactions on Speech and Language Processing · doi:10.1145/1233912.1233913 · Cited by 307 · cited 2×
“The pyramid metric is an indirect manual evaluation method (Nenkova et al., 2007) that has previously been used for BC3 (Ulrich et al., 2009).”
Cited by
Sarker, I. H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00815-1 · Cited by 2,678
A Survey of Deep Learning and Its Applications: A New Paradigm to Machine Learning
Dargan, S., Kumar, M., Ayyagari, M. R., & Kumar, G. (2020) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-019-09344-w · Cited by 1,198
Explainable artificial intelligence: a comprehensive review
Minh, D., Wang, H. X., Li, Y. F., & Nguyen, T. N. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10088-y · Cited by 983
Automatic text summarization: A comprehensive survey
El-Kassas, W. S., Salama, C. R., Rafea, A. A., & Mohamed, H. K. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113679 · Cited by 809
Deep Learning and Medical Diagnosis: A Review of Literature
Bakator, M., & Radosav, D. (2018) · Multimodal Technologies and Interaction · doi:10.3390/mti2030047 · Cited by 510
Metadata
- Authors
- Yousefi-Azar, M., & Hamey, L.
- Venue
- Expert Systems with Applications
- Publisher
- Elsevier BV
- Published
- 2017-02
- Volume
- 68
- Pages
- 93-105
- ISSN
- 0957-4174 (ISSN-L)
- OpenAlex
- W2530979053
- Cited by
- 247
- References
- 16
- FWCI
- 17.98
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.