Back to search

National and Kapodistrian University of Athens

Εξελιγμένες τεχνικές πρόβλεψης θέσης στον κινητό υπολογισμό

Abstract

dc:description

CONTEXT-AWARENESS IS VIEWED AS ONE OF THE MOST IMPORTANT ASPECTS IN THE EMERGING PERVASIVE COMPUTING PARADIGM. MOBILE CONTEXT-AWARE APPLICATIONS ARE REQUIRED TO SENSE AND REACT TO CHANGING ENVIRONMENT CONDITIONS. SUCH APPLICATIONS, USUALLY, NEED TO RECOGNIZE, CLASSIFY AND PREDICT CONTEXT IN ORDER TO ACT EFFICIENTLY, BEFOREHAND, FOR THE BENEFIT OF THE USER. FIRSTLY, WE PROPOSE AN EFFICIENT SPATIAL CONTEXT CLASSIFIER AND A SHORT-TERM PREDICTOR FOR THE FUTURE LOCATION OF A MOBILE USER IN CELLULAR NETWORKS. WE INTRODUCE DIFFERENT VARIANTS OF THE CONSIDERED LOCATION PREDICTOR DEALING WITH LOCATION (CELL) IDENTIFIERS AND DIRECTIONS. SYMBOLIC LOCATION CLASSIFICATION IS TREATED AS A SUPERVISED LEARNING PROBLEM. WE EVALUATE THE PREDICTION EFFICIENCY AND ACCURACY OF THE PROPOSED PREDICTORS THROUGH SYNTHETIC AND REAL-WORLD TRACES. SECONDLY, WE PROPOSE A NOVEL ADAPTIVE MOBILITY PREDICTION ALGORITHM, WHICH DEALS WITH LOCATION CONTEXT REPRESENTATION AND TRAJECTORY PREDICTION OF MOVING USERS. MACHINE LEARNING (ML) IS USED FOR TRAJECTORY CLASSIFICATION. OUR ALGORITHM ADOPTS SPATIAL AND TEMPORAL ON-LINE CLUSTERING, AND RELIES ON ADAPTIVE RESONANCE THEORY (ART) FOR TRAJECTORY PREDICTION. THE PROPOSED ALGORITHM APPLIES A HAUSDORFF-LIKE DISTANCE OVER THE EXTRACTED TRAJECTORIES HANDLING LOCATION PREDICTION. SINCE OUR APPROACH IS TIME-SENSITIVE, THE HAUSDORFF DISTANCE IS CONSIDERED MORE ADVANTAGEOUS THAN A SIMPLE EUCLIDEAN NORM. TWO LEARNING METHODS (NON-REINFORCEMENT AND REINFORCEMENT LEARNING) ARE PRESENTED AND EVALUATED. THIRDLY, WE PROPOSE A SHORT-MEMORY ADAPTIVE LOCATION PREDICTOR THAT REALIZES MOBILITY PREDICTION IN THE ABSENCE OF EXTENSIVE HISTORICAL MOBILITY INFORMATION. OUR PREDICTOR IS BASED ON A LOCAL LINEAR REGRESSION MODEL, WHILE ITS ADAPTATION CAPABILITY IS ACHIEVED THROUGH A FUZZY CONTROLLER. SUCH FUZZY CONTROLLER CAPITALIZES ON AN APPROPRIATE SIZE OF HISTORICAL MOBILITY INFORMATION IN ORDER TO MINIMIZE THE LOCATION PREDICTION ERROR AND PROVIDE FAST ADAPTATION TO ANY DETECTED MOVEMENT CHANGE. OUR PREDICTION EXPERIMENTS PERFORMED WITH REAL GPS DATA.FOURTHLY, WE ASSUME THE EXISTENCE OF A PATTERN BASE AND TRY TO COMPARE THE MOVEMENT PATTERN OF A CERTAIN USER WITH STORED INFORMATION IN ORDER TO PREDICT FUTURE LOCATIONS. A CONVENTIONAL PREDICTION SCHEME WOULD SUFFER FROM POTENTIAL NOISE IN MOVEMENT PATTERNS. SUCH NOISE (POSSIBLY MANIFESTED AS SMALL - RANDOM DEVIATIONS FROM PREVIOUSLY SEEN PATTERNS) (A) NEGATIVELY IMPACTS THE PREDICTION CAPABILITY OF THE CLASSIFICATION SYSTEM AND (B) DRIVES THE BASE TO STATE SPACE EXPLOSION. WE TRY TO ALLEVIATE SUCH SHORTCOMINGS THROUGH THE USE OF OPTIMAL STOPPING THEORY AND THE INTRODUCTION OF A VERY SPECIFIC MOVEMENT PREDICTION WORK–FLOW. OPTIMAL STOPPING THEORY RELAXES THE CLASSIFICATION TASK SO THAT SLIGHTLY DIFFERENT PATTERNS CAN BE TREATED AS EQUIVALENT. MOREOVER, THE UNDERLYING PATTERN BASE IS KEPT AS ‘CLEAN’ AND CONCISE AS POSSIBLE BY RETAINING THOSE PATTERNS WITH LIMITED SPATIAL VARIANCE. OUR FINDINGS, COMPARED WITH OTHER SCHEMES, ARE VERY PROMISING FOR THE LOCATION PREDICTION PROBLEM AND THE ADOPTION OF PROACTIVE CONTEXT-AWARE APPLICATIONS AND SERVICES.

Degree

thesis:*
Grantor dc:publisher
National and Kapodistrian University of Athens
Year dc:date
2012

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Anagnostopoulos, Theodoros
  • Αναγνωστόπουλος, Θεόδωρος

Subjects

dc:subject × 12

Rights

Language dc:language
gre

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/29168

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Anagnostopoulos, Theodoros; Αναγνωστόπουλος, Θεόδωρος. Εξελιγμένες τεχνικές πρόβλεψης θέσης στον κινητό υπολογισμό. National and Kapodistrian University of Athens, 2012. http://hdl.handle.net/10442/hedi/29168