A Mathematical Model for Temporal Data Mining In Estimation of Traffic Data over a Busy Area

Krishna A.V.N*
Associate Professor ,Indur Institute of Engg &Tech ,Siddipet ,A.P,India
Periodicity:January - March'2007
DOI : https://doi.org/10.26634/jse.1.3.739

Abstract

Many applications maintain temporal & spatial features in their databases. These features cannot be treated as any other attributes and need special attention. Temporal data mining has the capability to infer casual and temporal proximity relationships among different components of data. In this work a model is going to be developed which helps in measuring traffic data distributed over a wide area. This model considers the assumption that the data follow an ordered sequence. The area is divided into a set of grid points. Each grid point is identified by a set of coefficients. The traffic data at a particular location is measured. The coefficient at the identified location is mapped to measured traffic data value. Thus coefficient at the measured location is calculated. This coefficient is used to generate coefficient values at the other grid points by tridiagonal matrix algorithm. The procedure is repeated till the values cease to change for a unit time. The procedure is repeated for different intervals of time. Thus traffic data is obtained over the wide area for different times and at different locations.

Keywords

How to Cite this Article?

Krishna A.V.N (2007). A Mathematical Model for Temporal Data Mining In Estimation of Traffic Data over a Busy Area. i-manager’s Journal on Software Engineering, 1(3), 50-54. https://doi.org/10.26634/jse.1.3.739

References

[1]. Dan.W.Patterson .' Introduction to Artificial Intelligence & Expert Systems, Prentice-Hon of India Private limited -2001.
[2]. A.K.Pujari: Data Mining Technlques, Prentice-Hon of India Private limited-2002.
[3] . Ming-5yan Chen, Jong 5oo Park, Philip 5. Yu: Efflc/ent Data Mining for Path Traversal Patterns. IEEE Trons. Knowl, Data Eng I O(2): 209-221{ I 998)
[4]. Rakesh Agrawal, Christos Faloutsos, Arun N. swami: Efficient S/mllar/ly Search In Sequence Databases, FODO I 993: 69-84 BibTeX
[5]. Frank H6ppner. Leamlng Temporal Rules from State Sequences. In WLT5D, seottle, U5A, poges 25"-3 I , 2001
[6]. 8rockwell RJ. and Davis .R Introductlon to tlme serles and forecastlng, springer-Verlog, 1996.
[7].Das G., Gunupolos D., Mannila F/ndlng similar tlme serles, Monuscrip I 996
[8].Faloutos C., Ranganathan M., Manolopoulos Y. Fast subsequence matching In tlme series data bases. In 5IGMOD94, 1994,
[9].Ester M., Frommelt A., Kriegel H.R, And sander J. Algorithm for characterlzatlon and trend detectlon In spotiol doto Dose, Fourth KDD conference,1998.
[10].Allen J.F. Maintaining knowledge about temporal intervals, Commun.ACM, 26:11, 832-843, 1983.
[11]. Andrews,H.C.1972. /ntroductlon to mathematical techniques In pattern recognition. New York, Wiley Interscience.
[12]. Brochmon,R.J.1978 A structural paradigm for representing knowledge, Report No. 3605, Bolt Bernek and Newmon ,Inc. Combridge, Moss.
[1 3]. Dudo,R.O. , ond RE.Hort. I 973, Pattern C/assification and SceneAnalysis, NewYork, Wiley.
[14]. Todorovski L, Dzeroski S, Srinivoson A, Whiteley J, Govoghon D. Discovering the structure of partial differential equatlons from example behavlor. In Proceedings of the Seventeenth Internotionol Conferenceon Mochine Looming. Morgon Koufmonn, 2000; 991-998.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.