This thesis explores the possibility of estimating the outcome of a flight ticket fare comparison search, also called flight meta search, before it has been performed, as being able to do thiscould be highly useful in improving the flight meta search technology used today. The algorithm explored in this thesis is a distance weighted k-nearest neighbour, where the distance metric is a linear equation with sixteen features of first degree extracted from the input of the search. It is found that while the approach may have potential, the distance metric used in this thesis isnot sufficient to capture the similarities needed, and the end algorithm performs only slightly better than random. At the end of this thesis a series of possible further improvements are presented, that could potentially help improve the performance of the algorithm to a level that would be more useful.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:liu-108475 |
| Date | January 2014 |
| Creators | Kristensson, Lars |
| Publisher | Linköpings universitet, Institutionen för datavetenskap, Linköpings universitet, Filosofiska fakulteten |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0016 seconds