---
title: "HDLTex: Hierarchical Deep Learning for Text Classification (2017)"
description: "Sorting scientific literature automatically gets harder as collections grow, because topics and… 51 references, cited by 78 papers here."
authors: ["Kamran Kowsari", "Donald E. Brown", "Mojtaba Heidarysafa", "Kiana Jafari Meimandi", "Matthew S. Gerber", "Laura E. Barnes"]
year: 2017
venue: "ICMLA 2017"
source: "https://arxiv.org/abs/1709.08267"
arxiv: "1709.08267"
licence: "arXiv — non-exclusive distribution license"
licence_url: "http://arxiv.org/licenses/nonexclusive-distrib/1.0/"
summary_licence: "Elamur Cosmic License"
canonical: "https://research.elamur.ai/free/en/papers/kowsari-2017-hdltex-hierarchical-deep-learning-text/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/kowsari-2017-hdltex-hierarchical-deep-learning-text/)

[home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [2017](https://md.research.elamur.ai/free/en/papers/2017/page/2/) / HDLTex: Hierarchical Deep Learning for Text Classification

# HDLTex: Hierarchical Deep Learning for Text Classification

**Authors:** Kamran Kowsari, Donald E. Brown, Mojtaba Heidarysafa, Kiana Jafari Meimandi, [Matthew S. Gerber](https://md.research.elamur.ai/free/en/authors/matthew-gerber/) and Laura E. Barnes · **Year:** 2017 · **Venue:** ICMLA 2017 · **Licence:** [arXiv — non-exclusive distribution license](http://arxiv.org/licenses/nonexclusive-distrib/1.0/)

**Links:** [Publisher's page](https://doi.org/10.1109/icmla.2017.0-134) · [PDF](https://arxiv.org/pdf/1709.08267) · [arXiv 1709.08267](https://arxiv.org/abs/1709.08267) · [OpenAlex](https://openalex.org/W2759474451)

**Citations:** 454 citations (OpenAlex, 2026-10-14) · [78](https://md.research.elamur.ai/free/en/papers/kowsari-2017-hdltex-hierarchical-deep-learning-text/cited-by/) in our library, of the 149,439 papers whose bibliographies we read

## Summary
Sorting scientific literature automatically gets harder as collections grow, because topics and subtopics multiply too. Flat multi-class classifiers struggle once every field–subfield pair becomes its own label. HDLTex (Hierarchical Deep Learning for Text classification) treats the task as hierarchical. A parent-level deep network assigns a document to a broad field, such as Computer Science or Medical Science. A separate child-level network trained for that field then selects the specialization. Each level can be a DNN, CNN or RNN. CNN and RNN models read 100-dimensional GloVe embeddings, while DNN models use N-gram counts and tf-idf. The authors compare fifteen methods, including non-hierarchical baselines such as SVM variants and naïve Bayes. The references point to Web of Science as the document source. HDLTex is reported to beat traditional classifiers in accuracy. The provided excerpt omits the exact figures and dataset sizes. The open-source code is a reusable template for two-level topic classification and suits any library-style document taxonomy.

## Key points
- Motivation: in 2014, about 28,100 active peer-reviewed English-language journals published roughly 2.5 million articles, and the growth rate appears to be increasing.
- Architecture: one parent model predicts the top-level field, and a dedicated child model (Ψ_i) for each field predicts the subfield. The deep learning stacks can mix DNN, CNN and RNN.
- Features: CNN/RNN use 100-dimensional GloVe word vectors. DNN uses count-based N-gram features (e.g., 1- plus 2-grams) and tf-idf weighting.
- Baselines: term-weighted SVM, multi-word SVM, naïve Bayes classification, stacking SVM, and flat (non-hierarchical) DNN, CNN and RNN. Fifteen methods are compared in total.
- Resource: the code is released at github.com/kk7nc/HDLTex, and the implementation cites TensorFlow and Keras.

*Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.*

## Institutions

- [University of Virginia](https://md.research.elamur.ai/free/en/universities/university-of-virginia/) — University, Charlottesville, United States · 40 works · 10,099 citations

📚 Shelves (5): [🖥️ Computer Science](https://md.research.elamur.ai/free/en/shelves/computer-science/) · 18,614 works · [🤖 Artificial Intelligence](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · 17,965 works · [🎭 Arts and Humanities](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · 17,450 works · [🗣️ Language and Linguistics](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) · 17,296 works · [👁️ Computer Vision and Pattern Recognition](https://md.research.elamur.ai/free/en/shelves/computer-science/computer-vision-and-pattern-recognition/) · 3,486 works

💡 Concepts (1): [💡 Text classification](https://md.research.elamur.ai/free/en/concepts/text-classification/) · 50 works

## Cite

Cite as: Kamran Kowsari, Donald E. Brown, Mojtaba Heidarysafa, Kiana Jafari Meimandi, Matthew S. Gerber and Laura E. Barnes. 2017. HDLTex: Hierarchical Deep Learning for Text Classification. ICMLA 2017.

The paper itself, not this page. BibTeX from the library's record of the work.

```bibtex
@inproceedings{kowsari2017hdltex,
  title = {{HDLTex: Hierarchical Deep Learning for Text Classification}},
  author = {Kamran Kowsari, Donald E. Brown, Mojtaba Heidarysafa, Kiana Jafari Meimandi, Matthew S. Gerber and Laura E. Barnes},
  booktitle = {ICMLA 2017},
  year = {2017},
  doi = {10.1109/icmla.2017.0-134},
  eprint = {1709.08267},
  archivePrefix = {arXiv},
  url = {https://doi.org/10.1109/icmla.2017.0-134}
}
```

- [← previous Automatic Annotation and Evaluation of Error Types for Grammatical Error Correction](https://md.research.elamur.ai/free/en/papers/bryant-2017-automatic-annotation-evaluation-error-types/)
- [next → Creating Training Corpora for NLG Micro-Planners](https://md.research.elamur.ai/free/en/papers/gardent-2017-creating-training-corpora-nlg-micro/)
- [↑ back to papers of 2017](https://md.research.elamur.ai/free/en/papers/2017/page/2/)

## References

51 references, 10 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

1. M. Ware and M. Mabe, “The stm report: An overview of scientific and scholarly journal publishing,” 2015. [find](https://scholar.google.com/scholar?q=M%2E+Ware+and+M%2E+Mabe%2C+%E2%80%9CThe+stm+report%3A+An+overview+of+scientific+and+scholarly+journal+publishing%2C%E2%80%9D+2015%2E)
2. C. D. Manning, P. Raghavan, H. Schütze et al., Introduction to information retrieval. Cambridge university press Cambridge, 2008, vol. 1, no. 1. [find](https://scholar.google.com/scholar?q=C%2E+D%2E+Manning%2C+P%2E+Raghavan%2C+H%2E+Schu%CC%88tze+et+al%2E%2C+Introduction+to+information+retrieval%2E+Cambridge+university+press+Cambridge%2C+2008%2C+vol%2E+1%2C+no%2E+1%2E)
3. J. C. French, D. E. Brown, and N.-H. Kim, “A classification approach to boolean query reformulation,” JASIS, vol. 48, no. 8, pp. 694–706, 1997. [find](https://scholar.google.com/scholar?q=J%2E+C%2E+French%2C+D%2E+E%2E+Brown%2C+and+N%2E%2DH%2E+Kim%2C+%E2%80%9CA+classification+approach+to+boolean+query+reformulation%2C%E2%80%9D+JASIS%2C+vol%2E+48%2C+no%2E+8%2C+pp%2E+694%E2%80%93706%2C+1997%2E)
4. K. Kowsari, M. Yammahi, N. Bari, R. Vichr, F. Alsaby, and S. Y. Berkovich, “Construction of fuzzyfind dictionary using golay coding transformation for searching applications,” International Journal of Advanced Computer Science and Applications(IJACSA), vol. 6, pp. 81– 87, 2015. [find](https://scholar.google.com/scholar?q=K%2E+Kowsari%2C+M%2E+Yammahi%2C+N%2E+Bari%2C+R%2E+Vichr%2C+F%2E+Alsaby%2C+and+S%2E+Y%2E+Berkovich%2C+%E2%80%9CConstruction+of+fuzzyfind+dictionary+using+golay+coding+transformation+for+searching+applications%2C%E2%80%9D+International+Journal+of)
5. T. Joachims, “[Transductive inference for text classification using support vector machines](https://md.research.elamur.ai/free/en/papers/joachims-1999-transductive-inference-text-classification-svm/),” in ICML, vol. 99, 1999, pp. 200–209.
6. S. Tong and D. Koller, “Support vector machine active learning with applications to text classification,” Journal of machine learning research, vol. 2, no. Nov, pp. 45–66, 2001. [find](https://scholar.google.com/scholar?q=S%2E+Tong+and+D%2E+Koller%2C+%E2%80%9CSupport+vector+machine+active+learning+with+applications+to+text+classification%2C%E2%80%9D+Journal+of+machine+learning+research%2C+vol%2E+2%2C+no%2E+Nov%2C+pp%2E+45%E2%80%9366%2C+2001%2E)
7. M. Fernández-Delgado, E. Cernadas, S. Barro, and D. Amorim, “Do we need hundreds of classifiers to solve real world classification problems,” J. Mach. Learn. Res, vol. 15, no. 1, pp. 3133–3181, 2014. [find](https://scholar.google.com/scholar?q=M%2E+Ferna%CC%81ndez%2DDelgado%2C+E%2E+Cernadas%2C+S%2E+Barro%2C+and+D%2E+Amorim%2C+%E2%80%9CDo+we+need+hundreds+of+classifiers+to+solve+real+world+classification+problems%2C%E2%80%9D+J%2E+Mach%2E+Learn%2E+Res%2C+vol%2E+15%2C+no%2E+1%2C+pp%2E+3133%E2%80%933181%2C+2014%2E)
8. C. S. Leslie, E. Eskin, and W. S. Noble, “The spectrum kernel: A string kernel for svm protein classification.” in Pacific symposium on biocomputing, vol. 7, no. 7, 2002, pp. 566–575. [find](https://scholar.google.com/scholar?q=C%2E+S%2E+Leslie%2C+E%2E+Eskin%2C+and+W%2E+S%2E+Noble%2C+%E2%80%9CThe+spectrum+kernel%3A+A+string+kernel+for+svm+protein+classification%2E%E2%80%9D+in+Pacific+symposium+on+biocomputing%2C+vol%2E+7%2C+no%2E+7%2C+2002%2C+pp%2E+566%E2%80%93575%2E)
9. E. Eskin, J. Weston, W. S. Noble, and C. S. Leslie, “Mismatch string kernels for svm protein classification,” in Advances in neural information processing systems, 2003, pp. 1441–1448. [find](https://scholar.google.com/scholar?q=E%2E+Eskin%2C+J%2E+Weston%2C+W%2E+S%2E+Noble%2C+and+C%2E+S%2E+Leslie%2C+%E2%80%9CMismatch+string+kernels+for+svm+protein+classification%2C%E2%80%9D+in+Advances+in+neural+information+processing+systems%2C+2003%2C+pp%2E+1441%E2%80%931448%2E)
10. A. McCallum, K. Nigam et al., “[A comparison of event models for naive bayes text classification](https://md.research.elamur.ai/free/en/papers/mccallum-1998-comparison-event-models-naive-bayes/),” in AAAI-98 workshop on learning for text categorization, vol. 752. Citeseer, 1998, pp. 41–48.
11. S.-B. Kim, K.-S. Han, H.-C. Rim, and S. H. Myaeng, “Some effective techniques for naive bayes text classification,” IEEE transactions on knowledge and data engineering, vol. 18, no. 11, pp. 1457–1466, 2006. [find](https://scholar.google.com/scholar?q=S%2E%2DB%2E+Kim%2C+K%2E%2DS%2E+Han%2C+H%2E%2DC%2E+Rim%2C+and+S%2E+H%2E+Myaeng%2C+%E2%80%9CSome+effective+techniques+for+naive+bayes+text+classification%2C%E2%80%9D+IEEE+transactions+on+knowledge+and+data+engineering%2C+vol%2E+18%2C+no%2E+11%2C+pp%2E+1457%E2%80%931466%2C)
12. N. Van Linh, N. K. Anh, K. Than, and C. N. Dang, “An effective and interpretable method for document classification,” Knowledge and Information Systems, vol. 50, no. 3, pp. 763–793, 2017. [find](https://scholar.google.com/scholar?q=N%2E+Van+Linh%2C+N%2E+K%2E+Anh%2C+K%2E+Than%2C+and+C%2E+N%2E+Dang%2C+%E2%80%9CAn+effective+and+interpretable+method+for+document+classification%2C%E2%80%9D+Knowledge+and+Information+Systems%2C+vol%2E+50%2C+no%2E+3%2C+pp%2E+763%E2%80%93793%2C+2017%2E)
13. G. E. Hinton and R. R. Salakhutdinov, “Reducing the dimensionality of data with neural networks,” science, vol. 313, no. 5786, pp. 504–507, 2006. [find](https://scholar.google.com/scholar?q=G%2E+E%2E+Hinton+and+R%2E+R%2E+Salakhutdinov%2C+%E2%80%9CReducing+the+dimensionality+of+data+with+neural+networks%2C%E2%80%9D+science%2C+vol%2E+313%2C+no%2E+5786%2C+pp%2E+504%E2%80%93507%2C+2006%2E)
14. R. Johnson and T. Zhang, “[Effective use of word order for text categorization with convolutional neural networks](https://md.research.elamur.ai/free/en/papers/johnson-2015-effective-use-word-order-text/),” arXiv preprint arXiv:1412.1058, 2014.
15. Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE, vol. 86, no. 11, pp. 2278–2324, 1998. [find](https://scholar.google.com/scholar?q=Y%2E+LeCun%2C+L%2E+Bottou%2C+Y%2E+Bengio%2C+and+P%2E+Haffner%2C+%E2%80%9CGradient%2Dbased+learning+applied+to+document+recognition%2C%E2%80%9D+Proceedings+of+the+IEEE%2C+vol%2E+86%2C+no%2E+11%2C+pp%2E+2278%E2%80%932324%2C+1998%2E)
16. M. Oquab, L. Bottou, I. Laptev, and J. Sivic, “Learning and transferring mid-level image representations using convolutional neural networks,” in Proceedings of the IEEE conference on computer vision and pattern recognition, 2014, pp. 1717–1724. [find](https://scholar.google.com/scholar?q=M%2E+Oquab%2C+L%2E+Bottou%2C+I%2E+Laptev%2C+and+J%2E+Sivic%2C+%E2%80%9CLearning+and+transferring+mid%2Dlevel+image+representations+using+convolutional+neural+networks%2C%E2%80%9D+in+Proceedings+of+the+IEEE+conference+on+computer+vision+)
17. J. Y. Lee and F. Dernoncourt, “[Sequential short-text classification with recurrent and convolutional neural networks](https://md.research.elamur.ai/free/en/papers/lee-2016-sequential-short-text-classification-recurrent/),” arXiv preprint arXiv:1603.03827, 2016.
18. X. Zhang, J. Zhao, and Y. LeCun, “[Character-level convolutional networks for text classification](https://md.research.elamur.ai/free/en/papers/zhang-2015-character-level-convolutional-networks-text/),” in Advances in neural information processing systems, 2015, pp. 649–657.
19. L. Medsker and L. Jain, “Recurrent neural networks,” Design and Applications, vol. 5, 2001. [find](https://scholar.google.com/scholar?q=L%2E+Medsker+and+L%2E+Jain%2C+%E2%80%9CRecurrent+neural+networks%2C%E2%80%9D+Design+and+Applications%2C+vol%2E+5%2C+2001%2E)
20. R. Salakhutdinov, J. B. Tenenbaum, and A. Torralba, “Learning with hierarchical-deep models,” IEEE transactions on pattern analysis and machine intelligence, vol. 35, no. 8, pp. 1958–1971, 2013. [find](https://scholar.google.com/scholar?q=R%2E+Salakhutdinov%2C+J%2E+B%2E+Tenenbaum%2C+and+A%2E+Torralba%2C+%E2%80%9CLearning+with+hierarchical%2Ddeep+models%2C%E2%80%9D+IEEE+transactions+on+pattern+analysis+and+machine+intelligence%2C+vol%2E+35%2C+no%2E+8%2C+pp%2E+1958%E2%80%931971%2C+2013%2E)
21. G. B. Huang, H. Lee, and E. Learned-Miller, “Learning hierarchical representations for face verification with convolutional deep belief networks,” in Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on. IEEE, 2012, pp. 2518–2525. [find](https://scholar.google.com/scholar?q=G%2E+B%2E+Huang%2C+H%2E+Lee%2C+and+E%2E+Learned%2DMiller%2C+%E2%80%9CLearning+hierarchical+representations+for+face+verification+with+convolutional+deep+belief+networks%2C%E2%80%9D+in+Computer+Vision+and+Pattern+Recognition+%28CVPR%29%2C+20)
22. K. Chen, Z. Zhang, J. Long, and H. Zhang, “Turning from tf-idf to tf-igm for term weighting in text classification,” Expert Systems with Applications, vol. 66, pp. 245–260, 2016. [find](https://scholar.google.com/scholar?q=K%2E+Chen%2C+Z%2E+Zhang%2C+J%2E+Long%2C+and+H%2E+Zhang%2C+%E2%80%9CTurning+from+tf%2Didf+to+tf%2Digm+for+term+weighting+in+text+classification%2C%E2%80%9D+Expert+Systems+with+Applications%2C+vol%2E+66%2C+pp%2E+245%E2%80%93260%2C+2016%2E)
23. W. Zhang, T. Yoshida, and X. Tang, “Text classification based on multiword with support vector machine,” Knowledge-Based Systems, vol. 21, no. 8, pp. 879–886, 2008. [find](https://scholar.google.com/scholar?q=W%2E+Zhang%2C+T%2E+Yoshida%2C+and+X%2E+Tang%2C+%E2%80%9CText+classification+based+on+multiword+with+support+vector+machine%2C%E2%80%9D+Knowledge%2DBased+Systems%2C+vol%2E+21%2C+no%2E+8%2C+pp%2E+879%E2%80%93886%2C+2008%2E)
24. V. Vapnik and A. Y. Chervonenkis, “A class of algorithms for pattern recognition learning,” Avtomat. i Telemekh, vol. 25, no. 6, pp. 937–945, 1964. [find](https://scholar.google.com/scholar?q=V%2E+Vapnik+and+A%2E+Y%2E+Chervonenkis%2C+%E2%80%9CA+class+of+algorithms+for+pattern+recognition+learning%2C%E2%80%9D+Avtomat%2E+i+Telemekh%2C+vol%2E+25%2C+no%2E+6%2C+pp%2E+937%E2%80%93945%2C+1964%2E)
25. A. Y. Chervonenkis, “Early history of support vector machines,” in Empirical Inference. Springer, 2013, pp. 13–20. [find](https://scholar.google.com/scholar?q=A%2E+Y%2E+Chervonenkis%2C+%E2%80%9CEarly+history+of+support+vector+machines%2C%E2%80%9D+in+Empirical+Inference%2E+Springer%2C+2013%2C+pp%2E+13%E2%80%9320%2E)
26. B. E. Boser, I. M. Guyon, and V. N. Vapnik, “A training algorithm for optimal margin classifiers,” in Proceedings of the fifth annual workshop on Computational learning theory. ACM, 1992, pp. 144–152. [find](https://scholar.google.com/scholar?q=B%2E+E%2E+Boser%2C+I%2E+M%2E+Guyon%2C+and+V%2E+N%2E+Vapnik%2C+%E2%80%9CA+training+algorithm+for+optimal+margin+classifiers%2C%E2%80%9D+in+Proceedings+of+the+fifth+annual+workshop+on+Computational+learning+theory%2E+ACM%2C+1992%2C+pp%2E+144%E2%80%93152%2E)
27. R. Singh, A. Sekhon, K. Kowsari, J. Lanchantin, B. Wang, and Y. Qi, “Gakco: a fast gapped k-mer string kernel using counting,” 2017. [find](https://scholar.google.com/scholar?q=R%2E+Singh%2C+A%2E+Sekhon%2C+K%2E+Kowsari%2C+J%2E+Lanchantin%2C+B%2E+Wang%2C+and+Y%2E+Qi%2C+%E2%80%9CGakco%3A+a+fast+gapped+k%2Dmer+string+kernel+using+counting%2C%E2%80%9D+2017%2E)
28. J. Weston and C. Watkins, “Multi-class support vector machines,” Technical Report CSD-TR-98-04, Department of Computer Science, Royal Holloway, University of London, May, Tech. Rep., 1998. [find](https://scholar.google.com/scholar?q=J%2E+Weston+and+C%2E+Watkins%2C+%E2%80%9CMulti%2Dclass+support+vector+machines%2C%E2%80%9D+Technical+Report+CSD%2DTR%2D98%2D04%2C+Department+of+Computer+Science%2C+Royal+Holloway%2C+University+of+London%2C+May%2C+Tech%2E+Rep%2E%2C+1998%2E)
29. A. Sun and E.-P. Lim, “Hierarchical text classification and evaluation,” in Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on. IEEE, 2001, pp. 521–528. [find](https://scholar.google.com/scholar?q=A%2E+Sun+and+E%2E%2DP%2E+Lim%2C+%E2%80%9CHierarchical+text+classification+and+evaluation%2C%E2%80%9D+in+Data+Mining%2C+2001%2E+ICDM+2001%2C+Proceedings+IEEE+International+Conference+on%2E+IEEE%2C+2001%2C+pp%2E+521%E2%80%93528%2E)
30. F. Sebastiani, “[Machine learning in automated text categorization](https://md.research.elamur.ai/free/en/papers/sebastiani-2002-machine-learning-automated-text-categorization/),” ACM computing surveys (CSUR), vol. 34, no. 1, pp. 1–47, 2002.
31. D. D. Lewis, “Naive (bayes) at forty: The independence assumption in information retrieval,” in European conference on machine learning. Springer, 1998, pp. 4–15. [find](https://scholar.google.com/scholar?q=D%2E+D%2E+Lewis%2C+%E2%80%9CNaive+%28bayes%29+at+forty%3A+The+independence+assumption+in+information+retrieval%2C%E2%80%9D+in+European+conference+on+machine+learning%2E+Springer%2C+1998%2C+pp%2E+4%E2%80%9315%2E)
32. J. Pennington, R. Socher, and C. D. Manning, “[Glove: Global vectors for word representation](https://md.research.elamur.ai/free/en/papers/pennington-2014-glove-global-vectors-word-representation/).” in EMNLP, vol. 14, 2014, pp. 1532–1543.
33. W. B. Cavnar, J. M. Trenkle et al., “N-gram-based text categorization,” Ann Arbor MI, vol. 48113, no. 2, pp. 161–175, 1994. [find](https://scholar.google.com/scholar?q=W%2E+B%2E+Cavnar%2C+J%2E+M%2E+Trenkle+et+al%2E%2C+%E2%80%9CN%2Dgram%2Dbased+text+categorization%2C%E2%80%9D+Ann+Arbor+MI%2C+vol%2E+48113%2C+no%2E+2%2C+pp%2E+161%E2%80%93175%2C+1994%2E)
34. D. Glickman, “Comparing input words to a word dictionary for correct spelling,” Feb. 5 1985, uS Patent 4,498,148. [find](https://scholar.google.com/scholar?q=D%2E+Glickman%2C+%E2%80%9CComparing+input+words+to+a+word+dictionary+for+correct+spelling%2C%E2%80%9D+Feb%2E+5+1985%2C+uS+Patent+4%2C498%2C148%2E)
35. V. Kešelj, F. Peng, N. Cercone, and C. Thomas, “N-gram-based author profiles for authorship attribution,” in Proceedings of the conference pacific association for computational linguistics, PACLING, vol. 3, 2003, pp. 255–264. [find](https://scholar.google.com/scholar?q=V%2E+Kes%CC%8Celj%2C+F%2E+Peng%2C+N%2E+Cercone%2C+and+C%2E+Thomas%2C+%E2%80%9CN%2Dgram%2Dbased+author+profiles+for+authorship+attribution%2C%E2%80%9D+in+Proceedings+of+the+conference+pacific+association+for+computational+linguistics%2C+PACLING%2C+)
36. Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” Nature, vol. 521, no. 7553, pp. 436–444, 2015. [find](https://scholar.google.com/scholar?q=Y%2E+LeCun%2C+Y%2E+Bengio%2C+and+G%2E+Hinton%2C+%E2%80%9CDeep+learning%2C%E2%80%9D+Nature%2C+vol%2E+521%2C+no%2E+7553%2C+pp%2E+436%E2%80%93444%2C+2015%2E)
37. J. Lanchantin, R. Singh, B. Wang, and Y. Qi, “Deep motif dashboard: Visualizing and understanding genomic sequences using deep neural networks,” arXiv preprint arXiv:1608.03644, 2016. — [arXiv:1608.03644](https://arxiv.org/abs/1608.03644) [find](https://scholar.google.com/scholar?q=J%2E+Lanchantin%2C+R%2E+Singh%2C+B%2E+Wang%2C+and+Y%2E+Qi%2C+%E2%80%9CDeep+motif+dashboard%3A+Visualizing+and+understanding+genomic+sequences+using+deep+neural+networks%2C%E2%80%9D+arXiv+preprint+arXiv%3A1608%2E03644%2C+2016%2E+%E2%80%94+%5BarXiv%3A1608%2E03)
38. A. Karpathy, “The unreasonable effectiveness of recurrent neural networks,” [http://karpathy.github.io/2015/05/21/rnn-effectiveness/](http://karpathy.github.io/2015/05/21/rnn-effectiveness/), May 2015. [↗](http://karpathy.github.io/2015/05/21/rnn-effectiveness/)
39. Y. Bengio, P. Simard, and P. Frasconi, “Learning long-term dependencies with gradient descent is difficult,” IEEE transactions on neural networks, vol. 5, no. 2, pp. 157–166, 1994. [find](https://scholar.google.com/scholar?q=Y%2E+Bengio%2C+P%2E+Simard%2C+and+P%2E+Frasconi%2C+%E2%80%9CLearning+long%2Dterm+dependencies+with+gradient+descent+is+difficult%2C%E2%80%9D+IEEE+transactions+on+neural+networks%2C+vol%2E+5%2C+no%2E+2%2C+pp%2E+157%E2%80%93166%2C+1994%2E)
40. R. Pascanu, T. Mikolov, and Y. Bengio, “On the difficulty of training recurrent neural networks.” ICML (3), vol. 28, pp. 1310–1318, 2013. [find](https://scholar.google.com/scholar?q=R%2E+Pascanu%2C+T%2E+Mikolov%2C+and+Y%2E+Bengio%2C+%E2%80%9COn+the+difficulty+of+training+recurrent+neural+networks%2E%E2%80%9D+ICML+%283%29%2C+vol%2E+28%2C+pp%2E+1310%E2%80%931318%2C+2013%2E)
41. S. Lai, L. Xu, K. Liu, and J. Zhao, “Recurrent convolutional neural networks for text classification.” in AAAI, vol. 333, 2015, pp. 2267– 2273. [find](https://scholar.google.com/scholar?q=S%2E+Lai%2C+L%2E+Xu%2C+K%2E+Liu%2C+and+J%2E+Zhao%2C+%E2%80%9CRecurrent+convolutional+neural+networks+for+text+classification%2E%E2%80%9D+in+AAAI%2C+vol%2E+333%2C+2015%2C+pp%2E+2267%E2%80%93+2273%2E)
42. K. Cho, B. Van Merriënboer, C. Gulcehre, D. Bahdanau, F. Bougares, H. Schwenk, and Y. Bengio, “Learning phrase representations using rnn encoder-decoder for statistical machine translation,” arXiv preprint arXiv:1406.[1078, 2014](https://md.research.elamur.ai/free/en/papers/cho-2014-learning-phrase-representations-rnn-encoder/).
43. D. Scherer, A. Müller, and S. Behnke, “Evaluation of pooling operations in convolutional architectures for object recognition,” Artificial Neural Networks–ICANN 2010, pp. 92–101, 2010. [find](https://scholar.google.com/scholar?q=D%2E+Scherer%2C+A%2E+Mu%CC%88ller%2C+and+S%2E+Behnke%2C+%E2%80%9CEvaluation+of+pooling+operations+in+convolutional+architectures+for+object+recognition%2C%E2%80%9D+Artificial+Neural+Networks%E2%80%93ICANN+2010%2C+pp%2E+92%E2%80%93101%2C+2010%2E)
44. D. Kingma and J. Ba, “[Adam: A method for stochastic optimization](https://md.research.elamur.ai/free/en/papers/kingma-2014-adam-method-stochastic-optimization/),” arXiv preprint arXiv:1412.6980, 2014.
45. O. Poungpair, A. Pootong, P. Tongtawe, T. Songserm, P. Tapchaisri, and W. Chaicumpa, “Web of science R ,” COMMUNICATIONS, 2013. [find](https://scholar.google.com/scholar?q=O%2E+Poungpair%2C+A%2E+Pootong%2C+P%2E+Tongtawe%2C+T%2E+Songserm%2C+P%2E+Tapchaisri%2C+and+W%2E+Chaicumpa%2C+%E2%80%9CWeb+of+science+R+%2C%E2%80%9D+COMMUNICATIONS%2C+2013%2E)
46. T. Reuters, “Web of science.” 2012. [find](https://scholar.google.com/scholar?q=T%2E+Reuters%2C+%E2%80%9CWeb+of+science%2E%E2%80%9D+2012%2E)
47. S. Munzert, C. Rubba, P. Meißner, and D. Nyhuis, Automated data collection with R: A practical guide to web scraping and text mining. John Wiley & Sons, 2014. [find](https://scholar.google.com/scholar?q=S%2E+Munzert%2C+C%2E+Rubba%2C+P%2E+Mei%C3%9Fner%2C+and+D%2E+Nyhuis%2C+Automated+data+collection+with+R%3A+A+practical+guide+to+web+scraping+and+text+mining%2E+John+Wiley+%26+Sons%2C+2014%2E)
48. U. Gundecha, Selenium Testing Tools Cookbook. Packt Publishing Ltd, 2015. [find](https://scholar.google.com/scholar?q=U%2E+Gundecha%2C+Selenium+Testing+Tools+Cookbook%2E+Packt+Publishing+Ltd%2C+2015%2E)
49. L. Richardson, “Beautiful soup,” [https://www.crummy.com/software/BeautifulSoup/](https://www.crummy.com/software/BeautifulSoup/), May 2017. [↗](https://www.crummy.com/software/BeautifulSoup/)
50. M. Abadi, A. Agarwal, P. Barham, E. Brevdo, Z. Chen, C. Citro, G. S. Corrado, A. Davis, J. Dean, M. Devin et al., “[Tensorflow: Large-scale machine learning on heterogeneous distributed systems](https://md.research.elamur.ai/free/en/papers/abadi-2016-tensorflow-large-scale-machine-learning/),” arXiv preprint arXiv:1603.04467, 2016.
51. F. Chollet et al., “Keras: Deep learning library for theano and tensorflow,” [https://keras.io/](https://keras.io/) , 2015. [↗](https://keras.io/)

*Updated 29 October 2026*