Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Shaw, Arthur A.; * | Gopalan, N.P.
Affiliations: Department of Computer Applications, National Institute of Technology, Thiruchirappalli, Tamil Nadu, India
Correspondence: [*] Corresponding author: Arthur A. Shaw, Department of Computer Applications, National Institute of Technology, Thiruchirappalli 620015, Tamil Nadu, India. Tel.: +91 948 718 7668; Fax: +91 431 250 0133; E-mail: [email protected].
Abstract: Data mining is mainly concerned with analyzing large volumes of unstructured data and automatically discovering interesting relationships among them. This information leads to better knowledge and power. Finding Frequent Trajectory patterns are the recently emerging area in data mining. Using the principles of data mining frequent trajectory patterns are derived and knowledge can be obtained out of it. Maximum length of the frequent path will give information about traveling time taken to cross the stretch, alternate path taken to avoid congestion etc. Finding the longest trajectory from the frequent trajectory pattern is a more challenging task and is done efficiently in this paper. Currently existing methods use spatial and spatial-temporal data and follows histogram method to find the frequency of occurrence and clustering method to group the data to find frequent patterns. All these cases spatial or spatiotemporal data may not have any standard approach to find the longest frequent path. This issue is addressed specifically by applying the association based mining concepts in spatiotemporal data. The path derived by applying the modified Apriori and frequent pattern tree methods are compared with a standard graph based method currently available and their performance is analyzed. This approach may be applied to interesting game domains to find the longest frequent trajectory of balls.
Keywords: Data mining, frequent pattern mining, association mining, apriori algorithm, requent trajectory pattern
DOI: 10.3233/IDA-140661
Journal: Intelligent Data Analysis, vol. 18, no. 4, pp. 637-651, 2014
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]