{"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/deep-residual-bidir-lstm-for-human-activity","title":"Deep Residual Bidir-LSTM for Human Activity Recognition Using Wearable Sensors","arxiv_id":"1708.08989","date":"2017-08-22","proceeding":null,"authors":["Yu Zhao","Rennong Yang","Guillaume Chevalier","Maoguo Gong"],"abstract":"Human activity recognition (HAR) has become a popular topic in research\nbecause of its wide application. With the development of deep learning, new\nideas have appeared to address HAR problems. Here, a deep network architecture\nusing residual bidirectional long short-term memory (LSTM) cells is proposed.\nThe advantages of the new network include that a bidirectional connection can\nconcatenate the positive time direction (forward state) and the negative time\ndirection (backward state). Second, residual connections between stacked cells\nact as highways for gradients, which can pass underlying information directly\nto the upper layer, effectively avoiding the gradient vanishing problem.\nGenerally, the proposed network shows improvements on both the temporal (using\nbidirectional cells) and the spatial (residual connections stacked deeply)\ndimensions, aiming to enhance the recognition rate. When tested with the\nOpportunity data set and the public domain UCI data set, the accuracy was\nincreased by 4.78% and 3.68%, respectively, compared with previously reported\nresults. Finally, the confusion matrix of the public domain UCI data set was\nanalyzed.","url_abs":"http://arxiv.org/abs/1708.08989v2","url_pdf":"http://arxiv.org/pdf/1708.08989v2.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":"deep-residual-bidir-lstm-for-human-activity","repo_url":"https://github.com/guillaume-chevalier/HAR-stacked-residual-bidir-LSTMs","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"deep-residual-bidir-lstm-for-human-activity","repo_url":"https://github.com/Liut2016/stackedResBiLSTM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"deep-residual-bidir-lstm-for-human-activity","repo_url":"https://github.com/guillaume-chevalier/LSTM-Human-Activity-Recognition","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"deep-residual-bidir-lstm-for-human-activity","repo_url":"https://github.com/ibrahimalimetin/HDAD-iGAV-Dataset-and-its-Benchmarking-GUI-with-Deep-Learning-Techniques-for-HAR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"activity-recognition","task_name":"Activity Recognition"},{"task_slug":"human-activity-recognition","task_name":"Human Activity Recognition"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"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":"guillaume-chevalier/HAR-stacked-residual-bidir-LSTMs","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1609.08144"],"harvested_for_calls":[{"arxiv_id":"1609.08144","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1609.08144"},"call":"get_harvested_code_for_paper(arxiv_id=\"1609.08144\")"}]},{"repo":"Liut2016/stackedResBiLSTM","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1609.08144"],"harvested_for_calls":[{"arxiv_id":"1609.08144","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1609.08144"},"call":"get_harvested_code_for_paper(arxiv_id=\"1609.08144\")"}]},{"repo":"guillaume-chevalier/LSTM-Human-Activity-Recognition","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ibrahimalimetin/HDAD-iGAV-Dataset-and-its-Benchmarking-GUI-with-Deep-Learning-Techniques-for-HAR","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"b7b2ac0b187ed27ceff4395e87611761e3f219395699eb1231aa22f9cb88b709","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}