{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/tag-recommendation-for-online-q-a-communities","title":"Tag Recommendation for Online Q&A Communities based on BERT Pre-Training Technique","arxiv_id":"2010.04971","date":"2020-10-10","proceeding":null,"authors":["Navid Khezrian","Jafar Habibi","Issa Annamoradnejad"],"abstract":"Online Q&A and open source communities use tags and keywords to index, categorize, and search for specific content. The most obvious advantage of tag recommendation is the correct classification of information. In this study, we used the BERT pre-training technique in tag recommendation task for online Q&A and open-source communities for the first time. Our evaluation on freecode datasets show that the proposed method, called TagBERT, is more accurate compared to deep learning and other baseline methods. Moreover, our model achieved a high stability by solving the problem of previous researches, where increasing the number of tag recommendations significantly reduced model performance.","url_abs":"https://arxiv.org/abs/2010.04971v1","url_pdf":"https://arxiv.org/pdf/2010.04971v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"tag-recommendation-for-online-q-a-communities","repo_url":"https://github.com/Moradnejad/Bert-Based-Tag-Recommendation","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"multi-label-text-classification","task_name":"Multi-Label Text Classification"},{"task_slug":"tag","task_name":"TAG"},{"task_slug":"text-classification","task_name":"Text Classification"}],"methods":[{"method_slug":"adam","method_name":"Adam"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"attention-dropout","method_name":"Attention Dropout"},{"method_slug":"bert","method_name":"BERT"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"linear-warmup-with-linear-decay","method_name":"Linear Warmup With Linear Decay"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"weight-decay","method_name":"Weight Decay"},{"method_slug":"wordpiece","method_name":"WordPiece"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/multi-label-text-classification-on-freecode","task":"Multi-Label Text Classification","dataset":"Freecode","model":"TagBERT","rank_in_archive_order":1,"of":5,"metrics":{"F1-score":"46"},"uses_additional_data":false},{"leaderboard":"/sota/multi-label-text-classification-on-freecode","task":"Multi-Label Text Classification","dataset":"Freecode","model":"TagCNN","rank_in_archive_order":2,"of":5,"metrics":{"F1-score":"45.3"},"uses_additional_data":false},{"leaderboard":"/sota/multi-label-text-classification-on-freecode","task":"Multi-Label Text Classification","dataset":"Freecode","model":"TagMulRec","rank_in_archive_order":3,"of":5,"metrics":{"F1-score":"36.4"},"uses_additional_data":false},{"leaderboard":"/sota/multi-label-text-classification-on-freecode","task":"Multi-Label Text Classification","dataset":"Freecode","model":"EnTagRec","rank_in_archive_order":4,"of":5,"metrics":{"F1-score":"36"},"uses_additional_data":false},{"leaderboard":"/sota/multi-label-text-classification-on-freecode","task":"Multi-Label Text Classification","dataset":"Freecode","model":"FastTagRec","rank_in_archive_order":5,"of":5,"metrics":{"F1-score":"33.2"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"Moradnejad/Bert-Based-Tag-Recommendation","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"791746fd8287465579c109e013d240bcf566f153e4a4c475a3e4d44e6922186e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}