메뉴 건너뛰기




Volumn 13, Issue 1, 2009, Pages 27-55

Mining long, sharable patterns in trajectories of moving objects

Author keywords

Frequent itemset mining; Intelligent transportation systems; Mining; Moving object trajectories; Ride sharing; Spatio temporal data; SQL based pattern mining

Indexed keywords

ASSOCIATIVE PROCESSING; INTELLIGENT VEHICLE HIGHWAY SYSTEMS; MINING; TRACKING (POSITION); TRAJECTORIES; VEHICLE LOCATING SYSTEMS;

EID: 58549113868     PISSN: 13846175     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10707-007-0042-z     Document Type: Article
Times cited : (51)

References (22)
  • 1
    • 0027621699 scopus 로고
    • "Mining association rules between sets of items in large databases"
    • R. Agrawal, T. Imilienski, and A. Swami. "Mining association rules between sets of items in large databases," in Proc. of SIGMOD, pp. 207-216, 1993. 1993.
    • (1993) Proc. of SIGMOD , pp. 207-216
    • Agrawal, R.1    Imilienski, T.2    Swami, A.3
  • 2
    • 0001882616 scopus 로고
    • "Fast algorithms for mining association rules"
    • R. Agrawal and R. Srikant. "Fast algorithms for mining association rules," in Proc. of VLDB, pp. 487-499, 1994.
    • (1994) Proc. of VLDB , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 3
    • 0029212693 scopus 로고
    • "Mining sequential patterns"
    • R. Agrawal and R. Srikant. "Mining sequential patterns," in Proc. of ICDE, pp. 3-14, 1995.
    • (1995) Proc. of ICDE , pp. 3-14
    • Agrawal, R.1    Srikant, R.2
  • 4
    • 0035007850 scopus 로고    scopus 로고
    • "MAFIA: A maximal frequent itemset algorithm for transactional databases"
    • D. Burdick, M. Calimlim, and J. Gehrke. "MAFIA: A maximal frequent itemset algorithm for transactional databases," in Proc. of ICDE, pp. 443-452, 2001.
    • (2001) Proc. of ICDE , pp. 443-452
    • Burdick, D.1    Calimlim, M.2    Gehrke, J.3
  • 5
    • 26844477145 scopus 로고    scopus 로고
    • "Spatio-temporal rule mining: Issues and techniques"
    • G. Gidófalvi and T.B. Pedersen. "Spatio-temporal rule mining: Issues and techniques," in Proc. of DaWaK, pp. 275-284, 2005.
    • (2005) Proc. of DaWaK , pp. 275-284
    • Gidófalvi, G.1    Pedersen, T.B.2
  • 6
    • 34547402556 scopus 로고    scopus 로고
    • "ST-ACTS: A spatio-temporal activity simulator"
    • G. Gidófalvi and T.B. Pedersen. "ST-ACTS: A spatio-temporal activity simulator," in Proc. of ACM-GIS, pp. 155-162, 2006.
    • (2006) Proc. of ACM-GIS , pp. 155-162
    • Gidófalvi, G.1    Pedersen, T.B.2
  • 7
    • 84894315601 scopus 로고    scopus 로고
    • "Cab-sharing: An effective, door-to-door, on-demand transportation service"
    • G. Gidófalvi and T.B. Pedersen. "Cab-sharing: An effective, door-to-door, on-demand transportation service," in Proc. of ITS, 2007.
    • (2007) Proc. of ITS
    • Gidófalvi, G.1    Pedersen, T.B.2
  • 10
    • 27944443169 scopus 로고    scopus 로고
    • "GenMax: An efficient algorithm for mining maximal frequent itemsets"
    • K. Gouda and M.J. Zaki. "GenMax: An efficient algorithm for mining maximal frequent itemsets," in Data Mining and Knowledge Discovery, Vol. 11(3):223-242, 2005.
    • (2005) Data Mining and Knowledge Discovery , vol.11 , Issue.3 , pp. 223-242
    • Gouda, K.1    Zaki, M.J.2
  • 11
    • 84877359020 scopus 로고    scopus 로고
    • "Novel approaches to the indexing of moving object trajectories"
    • C.S. Jensen, D. Pfoser, and Y. Theodoridis. "Novel approaches to the indexing of moving object trajectories," in Proc. of VLDB, pp. 395-406, 2000.
    • (2000) Proc. of VLDB , pp. 395-406
    • Jensen, C.S.1    Pfoser, D.2    Theodoridis, Y.3
  • 14
    • 0002625450 scopus 로고    scopus 로고
    • "CLOSET: An efficient algorithm for mining frequent closed itemsets"
    • J. Pei, J. Han, and R. Mao. "CLOSET: An efficient algorithm for mining frequent closed itemsets," in Proc. of DMKD, pp. 11-20, 2000.
    • (2000) Proc. of DMKD , pp. 11-20
    • Pei, J.1    Han, J.2    Mao, R.3
  • 15
    • 85054077161 scopus 로고    scopus 로고
    • "A general map matching algorithm for transport telematics applications"
    • M. Quddus, W. Ochieng, L. Zhao, and R. Noland. "A general map matching algorithm for transport telematics applications," in GPS Solutions Journal, Vol. 7(3):157-167, 2003.
    • (2003) GPS Solutions Journal , vol.7 , Issue.3 , pp. 157-167
    • Quddus, M.1    Ochieng, W.2    Zhao, L.3    Noland, R.4
  • 16
    • 58549114976 scopus 로고    scopus 로고
    • "Efficient frequent pattern mining in relational databases"
    • X. Shang, K.-U. Sattler, and I. Geist. "Efficient frequent pattern mining in relational databases" in Proc. of LWA, pp. 84-91, 2004.
    • (2004) Proc. of LWA , pp. 84-91
    • Sattler, X.1    Shang, K.-U.2    Geist, I.3
  • 17
    • 84944067757 scopus 로고    scopus 로고
    • "Efficient mining of spatiotemporal patterns"
    • I. Tsoukatos and D. Gunopulos. "Efficient mining of spatiotemporal patterns," in Proc. of SSTD, pp. 425-442, 2001.
    • (2001) Proc. of SSTD , pp. 425-442
    • Tsoukatos, I.1    Gunopulos, D.2
  • 18
    • 0036211177 scopus 로고    scopus 로고
    • "Discovering similar multidimensional trajectories"
    • M. Vlachos, D. Gunopoulos, and G. Kollios. "Discovering similar multidimensional trajectories," in Proc. of ICDE, pp. 673-685, 2002.
    • (2002) Proc. of ICDE , pp. 673-685
    • Vlachos, M.1    Gunopoulos, D.2    Kollios, G.3
  • 19
    • 77952363125 scopus 로고    scopus 로고
    • "CLOSET+: Searching for the best strategies for mining frequent closed itemsets"
    • J. Wang, J. Han, and J. Pei. "CLOSET+: Searching for the best strategies for mining frequent closed itemsets," in Proc. of KDD, pp. 236-245, 2003.
    • (2003) Proc. of KDD , pp. 236-245
    • Wang, J.1    Han, J.2    Pei, J.3
  • 20
    • 33745458995 scopus 로고    scopus 로고
    • "Mining compressed frequent-pattern sets"
    • D. Xin, J. Han, X. Yan, and H. Cheng. "Mining compressed frequent-pattern sets," in Proc. of VLDB, pp. 709-720, 2005.
    • (2005) Proc. of VLDB , pp. 709-720
    • Xin, D.1    Han, J.2    Yan, X.3    Cheng, H.4
  • 21
    • 4444326044 scopus 로고    scopus 로고
    • "CloSpan: Mining closed sequential patterns in large datasets"
    • X. Yan, J. Han, and R. Afshar. "CloSpan: Mining closed sequential patterns in large datasets." in Proc. of SDM, pp. 166-177, 2003.
    • (2003) Proc. of SDM , pp. 166-177
    • Yan, X.1    Han, J.2    Afshar, R.3
  • 22
    • 0347709684 scopus 로고    scopus 로고
    • "CHARM: An efficient algorithm for closed itemset mining"
    • M.J. Zaki and C.J. Hsiao. "CHARM: An efficient algorithm for closed itemset mining," in Proc. of SDM, pp. 71-80, 2002.
    • (2002) Proc. of SDM , pp. 71-80
    • Zaki, M.J.1    Hsiao, C.J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.