• 제목/요약/키워드: location prediction

검색결과 727건 처리시간 0.043초

Developing an User Location Prediction Model for Ubiquitous Computing based on a Spatial Information Management Technique

  • Choi, Jin-Won;Lee, Yung-Il
    • Architectural research
    • /
    • 제12권2호
    • /
    • pp.15-22
    • /
    • 2010
  • Our prediction model is based on the development of "Semantic Location Model." It embodies geometrical and topological information which can increase the efficiency in prediction and make it easy to manipulate the prediction model. Data mining is being implemented to extract the inhabitant's location patterns generated day by day. As a result, the self-learning system will be able to semantically predict the inhabitant's location in advance. This context-aware system brings about the key component of the ubiquitous computing environment. First, we explain the semantic location model and data mining methods. Then the location prediction model for the ubiquitous computing system is described in details. Finally, the prototype system is introduced to demonstrate and evaluate our prediction model.

Mobility Prediction Algorithms Using User Traces in Wireless Networks

  • Luong, Chuyen;Do, Son;Park, Hyukro;Choi, Deokjai
    • 한국멀티미디어학회논문지
    • /
    • 제17권8호
    • /
    • pp.946-952
    • /
    • 2014
  • Mobility prediction is one of hot topics using location history information. It is useful for not only user-level applications such as people finder and recommendation sharing service but also for system-level applications such as hand-off management, resource allocation, and quality of service of wireless services. Most of current prediction techniques often use a set of significant locations without taking into account possible location information changes for prediction. Markov-based, LZ-based and Prediction by Pattern Matching techniques consider interesting locations to enhance the prediction accuracy, but they do not consider interesting location changes. In our paper, we propose an algorithm which integrates the changing or emerging new location information. This approach is based on Active LeZi algorithm, but both of new location and all possible location contexts will be updated in the tree with the fixed depth. Furthermore, the tree will also be updated even when there is no new location detected but the expected route is changed. We find that our algorithm is adaptive to predict next location. We evaluate our proposed system on a part of Dartmouth dataset consisting of 1026 users. An accuracy rate of more than 84% is achieved.

A Tracking System Using Location Prediction and Dynamic Threshold for Minimizing SMS Delivery

  • Lai, Yuan-Cheng;Lin, Jian-Wei;Yeh, Yi-Hsuan;Lai, Ching-Neng;Weng, Hui-Chuan
    • Journal of Communications and Networks
    • /
    • 제15권1호
    • /
    • pp.54-60
    • /
    • 2013
  • In this paper, a novel method called location-based delivery (LBD), which combines the short message service (SMS) and global position system (GPS), is proposed, and further, a realistic system for tracking a target's movement is developed. LBD reduces the number of short message transmissions while maintaining the location tracking accuracy within the acceptable range. The proposed approach, LBD, consists of three primary features: Short message format, location prediction, and dynamic threshold. The defined short message format is proprietary. Location prediction is performed by using the current location, moving speed, and bearing of the target to predict its next location. When the distance between the predicted location and the actual location exceeds a certain threshold, the target transmits a short message to the tracker to update its current location. The threshold is dynamically adjusted to maintain the location tracking accuracy and the number of short messages on the basis of the moving speed of the target. The experimental results show that LBD, indeed, outperforms other methods because it satisfactorily maintains the location tracking accuracy with relatively fewer messages.

동질적 특징추출을 이용한 상황예측 구조의 설계 (A Design of Context Prediction Structure using Homogeneous Feature Extraction)

  • 김형선;임경미;임재현
    • 인터넷정보학회논문지
    • /
    • 제11권4호
    • /
    • pp.85-94
    • /
    • 2010
  • 본 논문은 사용자가 이동하려는 위치를 사전에 예측하고 예측된 정보를 이용하여 사용자 서비스를 미리 제공할 수 있도록 하는 위치예측 구조를 제안한다. 제안한 구조는 7개의 단계를 거쳐 사용자의 위치예측 및 지능화된 서비스를 제공하도록 한다. 물리적 센서와 히스토리 데이터베이스로부터 수집된 상황정보는 이질적인 데이터 형태를 갖기 때문에 이로 인한 데이터의 중요도 및 추상화 과정에 어려움이 있다. 이에 본 논문은 데이터의 유형을 동질적인 형태로 바꾸어 특징 추출을 하는 위치 예측구조를 제안한다. 추출된 값은 SOFM을 통해 군집화하고 ARIMA를 통해 미리 사용자의 위치 정보를 얻으며, 추론 엔진을 거쳐 최종 서비스를 실현한다. 제안된 위치예측 구조의 검증을 위해 테스트베드를 구축하고 시나리오에 따라 실험한다.

Data mining approach to predicting user's past location

  • Lee, Eun Min;Lee, Kun Chang
    • 한국컴퓨터정보학회논문지
    • /
    • 제22권11호
    • /
    • pp.97-104
    • /
    • 2017
  • Location prediction has been successfully utilized to provide high quality of location-based services to customers in many applications. In its usual form, the conventional type of location prediction is to predict future locations based on user's past movement history. However, as location prediction needs are expanded into much complicated cases, it becomes necessary quite frequently to make inference on the locations that target user visited in the past. Typical cases include the identification of locations that infectious disease carriers may have visited before, and crime suspects may have dropped by on a certain day at a specific time-band. Therefore, primary goal of this study is to predict locations that users visited in the past. Information used for this purpose include user's demographic information and movement histories. Data mining classifiers such as Bayesian network, neural network, support vector machine, decision tree were adopted to analyze 6868 contextual dataset and compare classifiers' performance. Results show that general Bayesian network is the most robust classifier.

탐색 트리를 이용한 건물 내 사용자의 위치 예측 방법 (User Location Prediction Within a Building Using Search Tree)

  • 오세창
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2010년도 추계학술대회
    • /
    • pp.585-588
    • /
    • 2010
  • 건물 내에서 특정 사용자의 현 위치를 예측하는 문제는 방문자의 안내 등 다양하게 응용될 수 있다. 이 문제를 풀기 위해 기존 방법들은 사용자가 과거에 이동한 패턴을 한정된 길이만큼만 고려하여 예측한다. 이는 복잡한 이동 패턴을 모델링 할 수 없고, 단순한 이동 패턴은 필요 이상으로 상세히 모델링함으로써 시스템의 효율을 떨어뜨림은 물론이고, 예측 오류를 야기한다. 본 논문에서는 기존의 방법들과는 달리 최근 이동 경로의 길이에 제한을 두지 않고 이동 패턴을 구분하는데 필요한 만큼만 고려하여 예측 결과를 도출하고자 한다. 이를 위해 탐색 트리를 사용하는데, 이 탐색 트리는 위치 예측에 필요한 만큼만 장소를 비교하도록 구성된다. 이 탐색 트리는 효율적이고 정확한 예측을 가능하게 해준다.

  • PDF

Multi-Label Classification Approach to Location Prediction

  • Lee, Min Sung
    • 한국컴퓨터정보학회논문지
    • /
    • 제22권10호
    • /
    • pp.121-128
    • /
    • 2017
  • In this paper, we propose a multi-label classification method in which multi-label classification estimation techniques are applied to resolving location prediction problem. Most of previous studies related to location prediction have focused on the use of single-label classification by using contextual information such as user's movement paths, demographic information, etc. However, in this paper, we focused on the case where users are free to visit multiple locations, forcing decision-makers to use multi-labeled dataset. By using 2373 contextual dataset which was compiled from college students, we have obtained the best results with classifiers such as bagging, random subspace, and decision tree with the multi-label classification estimation methods like binary relevance(BR), binary pairwise classification (PW).

시공간 분석 기반 연쇄 범죄 거점 위치 예측 알고리즘 (Base Location Prediction Algorithm of Serial Crimes based on the Spatio-Temporal Analysis)

  • 홍동숙;김정준;강홍구;이기영;서종수;한기준
    • 한국공간정보시스템학회 논문지
    • /
    • 제10권2호
    • /
    • pp.63-79
    • /
    • 2008
  • 고급 GIS 및 복잡한 공간 분석 기술이 발전함에 따라 다양한 의사 결정 지원 시스템에서 지리적 혹은 공간적 문제 해결을 위한 고급 지식을 지원하기 위해 더욱 강력한 기술이 필요하게 되었다. 또한, 법집행 기관 및 수사 기관 등을 중심으로 효율적인 수사 및 향후 범죄 예방을 위해 과학 수사, 법 과학에 관한 연구의 필요성이 증대되고 있다. 특히, 연쇄 범죄의 공간적 패턴을 분석함으로써 범죄자의 거점 위치를 예측하기 위한 지리적 프로파일링(Geographic Profiling)에 대한 연구가 활발하다. 그러나, 기존의 지리적 프로파일링 연구에서는 공간적 패턴 분석을 위해 단순히 통계적 방법만을 사용하고 있고, 연쇄 범죄에 대한 다양한 공간적, 시간적 분석 기술을 지원하지 않으므로 거점 예측시 낮은 정확도를 보인다. 그러므로, 본 논문에서는 범행 위치의 공간적 분포와 범죄 발생의 시간적 분포 특성에 따라 연쇄 범죄의 시공간 패턴을 유형화하고, 이를 기반으로 연쇄 범죄의 거점 위치를 보다 정확하게 예측하는 알고리즘으로 STA-BLP(Spatio-Temporal Analysis based Base Location Prediction)을 제안한다. STA-BLP는 하나의 거점으로부터 특정 방향을 선호하여 이동하며 발생되는 연쇄 범죄의 비등방성 패턴을 고려하고, 동일한 경로에 대한 반복 이동에 대한 범죄자의 학습 효과를 고려함으로써 예측 정확도를 개선시킨다. 또한, 다수의 군집화된 범행 위치들로부터 각 군집에 소속된 범행 위치들에 대한 지역적 거점 위치 예측과 모든 범행 위치에 대한 전역적 거점 위치 예측을 통해 거점이 다수 존재하는 연쇄 범죄의 경우에도 보다 정확한 예측을 수행한다. 마지막으로 다양한 실험을 통해 기존에 제시된 알고리즘과 STA-BLP의 예측 정확도를 비교하여 제안 알고리즘의 우수성을 입증하였다.

  • PDF

송전선로 거리표정치에 대한 실 고장거리의 확률적 예측방안 (A study on the prediction method of the real fault distance using probability to the relay data of transmission line fault location)

  • 이용희;백두현;장석한
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2006년도 제37회 하계학술대회 논문집 A
    • /
    • pp.10-11
    • /
    • 2006
  • The fault location is obtained from the distance relay that detects the fault of the transmission line. In this time, transmission line crews track down the fault location and the reasons. However, because of having error at the fault location of the distance relay, there is a discordance between real and obtained fault location. As this reason, the inspection time for finding fault location can be longer. In this paper, we proposed the statistical (regression) analysis method based on each type of relay's the historical fault location data and the real fault distance data to improve the problems. With finding the regression equation based on the regression analysis, and putting the relay fault location into that equation, the real fault distance is calculated. As a result of the Prediction fault location, the inspection time of transmission line can be reduced.

  • PDF

Using an Adaptive Search Tree to Predict User Location

  • Oh, Se-Chang
    • Journal of Information Processing Systems
    • /
    • 제8권3호
    • /
    • pp.437-444
    • /
    • 2012
  • In this paper, we propose a method for predicting a user's location based on their past movement patterns. There is no restriction on the length of past movement patterns when using this method to predict the current location. For this purpose, a modified search tree has been devised. The search tree is constructed in an effective manner while it additionally learns the movement patterns of a user one by one. In fact, the time complexity of the learning process for a movement pattern is linear. In this process, the search tree expands to take into consideration more details about the movement patterns when a pattern that conflicts with an existing trained pattern is found. In this manner, the search tree is trained to make an exact matching, as needed, for location prediction. In the experiments, the results showed that this method is highly accurate in comparison with more complex and sophisticated methods. Also, the accuracy deviation of users of this method is significantly lower than for any other methods. This means that this method is highly stable for the variations of behavioral patterns as compared to any other method. Finally, 1.47 locations were considered on average for making a prediction with this method. This shows that the prediction process is very efficient.