Shadi A. Aljawarneh, V. R. Krishna, Aravind Cheruvu
{"title":"在时间戳时间数据集中寻找相似的模式","authors":"Shadi A. Aljawarneh, V. R. Krishna, Aravind Cheruvu","doi":"10.1109/ICEMIS.2017.8273105","DOIUrl":null,"url":null,"abstract":"The research objective in this paper is to address the scope for research to design dissimilarity measure which uses the standard score and normal probability. Traditionally, the dissimilarity measure used is Euclidean distance to obtain dissimilarity between two known vectors of m-dimensions. The measure addressed in this paper maps the temporal pattern expressed as support vectors to z-space vectors. The dissimilarity measures uses these z-space vectors to find the dissimilarity degree between any two patterns expressed as support vectors. The procedure to retrieve similar patterns is outlined as the algorithm which uses distance and support bounds to eliminate and prune patterns that are not the required candidate patterns.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"206 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"Finding similar patterns in time stamped temporal datasets\",\"authors\":\"Shadi A. Aljawarneh, V. R. Krishna, Aravind Cheruvu\",\"doi\":\"10.1109/ICEMIS.2017.8273105\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The research objective in this paper is to address the scope for research to design dissimilarity measure which uses the standard score and normal probability. Traditionally, the dissimilarity measure used is Euclidean distance to obtain dissimilarity between two known vectors of m-dimensions. The measure addressed in this paper maps the temporal pattern expressed as support vectors to z-space vectors. The dissimilarity measures uses these z-space vectors to find the dissimilarity degree between any two patterns expressed as support vectors. The procedure to retrieve similar patterns is outlined as the algorithm which uses distance and support bounds to eliminate and prune patterns that are not the required candidate patterns.\",\"PeriodicalId\":117908,\"journal\":{\"name\":\"2017 International Conference on Engineering & MIS (ICEMIS)\",\"volume\":\"206 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Engineering & MIS (ICEMIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEMIS.2017.8273105\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Engineering & MIS (ICEMIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEMIS.2017.8273105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Finding similar patterns in time stamped temporal datasets
The research objective in this paper is to address the scope for research to design dissimilarity measure which uses the standard score and normal probability. Traditionally, the dissimilarity measure used is Euclidean distance to obtain dissimilarity between two known vectors of m-dimensions. The measure addressed in this paper maps the temporal pattern expressed as support vectors to z-space vectors. The dissimilarity measures uses these z-space vectors to find the dissimilarity degree between any two patterns expressed as support vectors. The procedure to retrieve similar patterns is outlined as the algorithm which uses distance and support bounds to eliminate and prune patterns that are not the required candidate patterns.