{"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/quickcharnet-an-efficient-url-classification","title":"QuickCharNet: An Efficient URL Classification Framework for Enhanced Search Engine Optimization","arxiv_id":null,"date":"2024-10-22","proceeding":"IEEE Access 2024 10","authors":["Fardin Rastakhiz","Mahdi Eftekhari","Sahar Vahdati"],"abstract":"The uniform resource locator (URL) conveys essential information about a page’s topic, authority, and security, which significantly influences its ranking in search engine results. However, many existing URL classification methods used for real-time online inference face challenges related to time and memory complexity during preprocessing, processing, and inference stages. In environments where quick decision-making is crucial, such as cybersecurity or digital marketing, slow or resource-intensive classification processes can limit the ability to prioritize and select URLs effectively. This study presents QuickCharNet, a novel URL classification architecture that combines character-level convolution with token-level representation to improve efficiency and generalizability for real-time URL inference. Key contributions of QuickCharNet include the use of max and mean pooling techniques to aggregate character embeddings into token embeddings, the exploration of sub-word tokenizers for optimal URL representation, and a comparative analysis of five models using metrics such as accuracy, F1-Score, and t-distributed Stochastic Neighbor Embedding (t-SNE) visualizations. By prioritizing user experience and safety, this research aims to enhance the accuracy of topic classification based on URL positioning in search engine results and evaluate the likelihood of spam. Ultimately, the findings support developers in efficiently identifying and addressing URL-related issues for improved search engine optimization. QuickCharNet was trained on a dataset developed for this study and two benchmark datasets. Experiments revealed optimal settings for URL classification and spam detection, resulting in a 4.92% improvement in topic classification and a 1% improvement in spam detection. These results emphasize the significance of URLs in search engine optimization: well-named URLs enable better topic classification, increasing the likelihood of appearing on the first page of search engine results by 4.92%. Conversely, URLs identified as spam face a higher chance of lower rankings, impacting their first-page visibility by 1%. Link to the source codes: https://github.com/FardinRastakhiz/QuickCharNet .","url_abs":"https://ieeexplore.ieee.org/abstract/document/10729268","url_pdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10729268","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":"quickcharnet-an-efficient-url-classification","repo_url":"https://github.com/FardinRastakhiz/QuickCharNet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"efficient-neural-network","task_name":"Efficient Neural Network"},{"task_slug":"marketing","task_name":"Marketing"},{"task_slug":"spam-detection","task_name":"Spam detection"},{"task_slug":"topic-classification","task_name":"Topic Classification"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[{"slug":"google-ranked-urls-dataset","name":"Google Ranked URLs Dataset","full_name":""}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"FardinRastakhiz/QuickCharNet","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":"756218ff12d2c07021269c4cc7fcc1833a726b5af095c9ecfd7db861ee4af803","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}