Finding N-most prevalent colocated event sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5691 LNCS, Issue , 2009, Pages 415-427

  Yoo, Jin Soung ^a   Bow, Mark ^a  

^a INDIANA UNIVERSITY PURDUE UNIVERSITY FORT WAYNE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC DESIGN; CO-LOCATED; CO-LOCATION PATTERNS; COLOCATIONS; EVENT SETS; GEOGRAPHIC AREAS; PATTERN SIZE; PRIOR KNOWLEDGE; SPATIAL CO-LOCATION PATTERNS; SPATIAL DATA; SPATIAL DATASETS; SPATIAL EVENTS;

MINING;

DATA WAREHOUSES;

EID: 70349336149     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03730-6_33     Document Type: Conference Paper

References (23)

1. Arshad, M.U., Ayyaz, M.N.: Mining N-most Iteresting Itemsets using Support-Ordered Tries. In: IEEE Int'l Conf. on Computer Systems and Applications (2006)
2. Cheung, Y., Fu, A.W.: Mining Frequent Itemsets without Support Threshold:With and Without Item Constraints. IEEE Transactions on Knowledge and Data Engineering 16(9) (2004)
3. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. McGraw-Hill Science, New York (2003)
4. Ding, W., Jiamthapthaksin, R., Parmar, R., Jiang, D., Stepinski, T.F., Eick, C.F.: Towards Region Discovery in Spatial Datasets. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS, vol. 5012, pp. 88-99. Springer, Heidelberg (2008)
5. Eick, C.F., Parmar, R., Ding, W., Stepinski, T.F., Nicot, J.: Finding Regional Colocation Patterns for Sets of Continuous Variables in Spatial Datasets. In: Proc. of ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems(ACM-GIS) (2008)
6. Fu, A.W., Kwong, R.W., Tang, J.: Mining N-most Interesting Itemsets. In: International Syposium on Methodologies for Intelligent Systems (2000)
7. Han, J., Pei, J., Yin, Y.: Mining Frequent PatternsWithout Candidate Generation. In: Proc. of ACM SIGMOD Conference on Management of Data (2000)
8. Hirate, Y., Iwahashi, E., Yamana, H.: TF2P-growth: An Efficient Algorithm for Mining Frequent Patterns without any Thresholds. In: Proc. of Workshop on Alternative Techniques for Data Mining and Knowledge Discovery (2004)
9. Huang, Y., Zhang, L., Yu, P.: Can we apply projection based frequent pattern mining paradigm to spatial co-location mining? In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS, vol. 3518, pp. 719-725. Springer, Heidelberg (2005)
10. Inokuchi, A., Washio, T., Motoda, H.: An Apriori-based Algorithm for Mining Frequent Substructures from Graph Data. In: Proc. of European Conference on Principles of Data Mining and Knowledge Discovery (2000)
11. Koperski, K., Han, J.: Discovery of Spatial Association Rules in Geographic Information Databases. In: Proc. of International Symposium on Large Spatial Data bases, Maine, pp. 47-66 (1995)
12. Kuramochi, M., Karypis, G.: Fequent Subgraph Discovery. In: IEEE International Conference on Data Mining (2001)
13. Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.: On Trip Planning Queries in Spatial Databases. In: Proc. of Interational Symposium on Advances in Spatial and Temporal Databases(SSTD) (2005)
14. Morimoto, Y.: Mining Frequent Neighboring Class Sets in Spatial Databases. In: Proc. ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (2001)
15. Shekhar, S., Chawla, S.: Spatial Databases: A Tour. Prentice-Hall, Englewood Cliffs (2003)
16. Shekhar, S., Huang, Y.: Co-location Rules Mining: A Summary of Results. In: Proc. of International Symposium on Spatial and Temporal Database, SSTD (2001)
17. Wang, J., Han, J., Lu, Y., Tzvetkov, P.: TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets. IEEE Transactions on Knowledge and Data Engineering 17(5) (2005)
18. Xiao, X., Xie, X., Luo, Q., Ma, W.: Density based co-location pattern discovery. In: Proc. of ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM-GIS) (2008)
19. Yan, X., Han, J.: gSpan: Graph-Baseed Substructure Pattern Mining. In: IEEE International Conference on Data Mining (2001)
20. Yoo, J.S., Bow, M.: Finding N-Most Prevalent Colocated Event Sets: A Summary of Results. Technical Report (2009), http://users.ipfw.edu/yooj/ publications/NMost-Summary.pdf
21. Yoo, J.S., Shekhar, S.: A Partial Join Approach for Mining Co-location Patterns. In: Proc. of ACM ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems(ACM-GIS) (2004)
22. Yoo, J.S., Shekhar, S.: A Join-less Approach for Mining Spatial Co-location Patterns. IEEE Transactions on Knowledge and Data Engineering 18(10) (2006)
23. Zou, L., Chen, L., Lu, Y.: Top-k Subgraph Matching Query in a Large Graph. In: Proc. of Conference on Information and Knowledge Management (2000)