<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Soft Computing Journal</JournalTitle>
				<Issn>2322-3707</Issn>
				<Volume>11</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2022</Year>
					<Month>08</Month>
					<Day>23</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Using string similarity techniques to detect daily activities in smart homes equipped with a binary sensor network</ArticleTitle>
<VernacularTitle>Using string similarity techniques to detect daily activities in smart homes equipped with a binary sensor network</VernacularTitle>
			<FirstPage>72</FirstPage>
			<LastPage>87</LastPage>
			<ELocationID EIdType="pii">112899</ELocationID>
			
<ELocationID EIdType="doi">10.22052/scj.2022.243385.1033</ELocationID>
			
			<Language>FA</Language>
<AuthorList>
<Author>
					<FirstName>Ashkan</FirstName>
					<LastName>Nikaiin</LastName>
<Affiliation>Department of Computer Engineering, Faculty of Engineering, Arak University, Arak, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Mohsen</FirstName>
					<LastName>Rahmani</LastName>
<Affiliation>Department of Computer Engineering, Faculty of Engineering, Arak University, Arak, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2021</Year>
					<Month>12</Month>
					<Day>26</Day>
				</PubDate>
			</History>
		<Abstract>Human activity recognition can be employed in systems that provide support to people who need special care in their daily activities. Various machine learning methods, including Hidden Markov Models and their extensions, are widely used to deal with this problem. In the previous works, HMM-based methods use the conditional independent assumption to compute the probability of a segment of observations. In this research, instead of conditional independent assumption, a new probabilistic model for string space, based on Dynamic Time Warping and Weighted Levenstein Distance is proposed. The model, combined with the Hidden semi-Markov Model, is applied to a publicly available dataset. The results show that the use of the proposed model significantly increases the accuracy of identifying daily activities. All the code and data of this paper are available through the link github.com/ashnik1353.</Abstract>
			<OtherAbstract Language="FA">Human activity recognition can be employed in systems that provide support to people who need special care in their daily activities. Various machine learning methods, including Hidden Markov Models and their extensions, are widely used to deal with this problem. In the previous works, HMM-based methods use the conditional independent assumption to compute the probability of a segment of observations. In this research, instead of conditional independent assumption, a new probabilistic model for string space, based on Dynamic Time Warping and Weighted Levenstein Distance is proposed. The model, combined with the Hidden semi-Markov Model, is applied to a publicly available dataset. The results show that the use of the proposed model significantly increases the accuracy of identifying daily activities. All the code and data of this paper are available through the link github.com/ashnik1353.</OtherAbstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">activity recognition</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">hidden semi Markov model</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">string dissimilarity</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Weighted Levenstein Distance</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Dynamic Time Warping</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scj.kashanu.ac.ir/article_112899_2f755f27b7502114567ffcbdb021dbbe.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
