Unsupervised activity discovery and characterization from event-streams

Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005

Volumn , Issue , 2005, Pages 251-258

  Hamid, Raffay ^a   Maddi, Siddhartha ^a   Johnson, Amos ^a   Bobick, Aaron ^a   Essa, Irfan ^a   Isbell, Charles ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES;

ACTIVE ENVIRONMENTS; ACTIVITY DISCOVERIES; DIFFERENT CLASS; EDGE-WEIGHTED GRAPH; MAXIMAL CLIQUE; RECURRENT EVENTS; STRUCTURAL INFORMATION; VARIABLE LENGTH;

ARTIFICIAL INTELLIGENCE;

EID: 67649391719     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. [Apostolico and Bejerano2000] A. Apostolico and J. Bejerano. Optimal amnesic probabilistic automata. J. of Comp. Biology, 7:381-393, 2000.
2. [Auguston and Miker1970] J. Auguston and J. Miker. An analysis of some graph theoretical clustering techniques. J. ACM, 17(4):571-588, 1970.
3. [Bailey and Elkan1994] T. Bailey and C. Elkan. Fitting a mixture model by expectation maximization to discover motifs in biopolymers. In Proc Int. Conf. Intell. Syst. Mol. Biol., pp. 28-36, 1994.
4. [Bejerano and Yona1999] G. Bejerano and G. Yona. Modeling protein families using probabilistic suffix trees. In In the Proc. of RECOMB, 1999.
5. [Chiu etal.2003] B. Chiu, E. Keogh, and S. Lonardi. Probabilistic discovery of time series motifs. In SIGKDD, 2003.
6. [Gusfield1997] Dan Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press; 1st edition, 1997.
7. [Hongeng and Nevatia2001] S. Hongeng and R. Nevatia. Multiagent event recognition. In In Proc. of IEEE ICCV, 2001.
8. [Ivanov and Bobick2000] Y. Ivanov and A. Bobick. Recognition of visual activities and interactions by stochastic parsing. PAMI, 22(8):852-872, 2000.
9. [Kleinberg1999] J. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46, 1999.
10. [Minnen etal.2003] D. Minnen, I. Essa, and T. Starner. Expectation grammars: Leveraging high-level expectations for activity recognition. In IEEE Conference on CVPR. Madison, WI., 2003.
11. [Oates2002] T. Oates. Peruse: An unsupervised algorithm for finding recurring patterns in time series. In IEEE ICDM, Japan., 2002.
12. [Pavan and Pelillo2003] M. Pavan and M. Pelillo. A new graphtheoretic approach to clustering and segmentation. In CVPR, 2003.
13. [Raghavan and Yu1981] V. Raghavan and C. Yu. A comparison of the stability characteristics of some graph theoretic clustering methods. IEEE Trans. on PAMI, 3:393-402, 1981. (Pubitemid 11522280)
14. [Ron etal.1996] D. Ron, Y. Singer, and N. Tishby. The power of amnesia: learning probabilistic automata with variable memory length. Machine Learning, 25:117-149, 1996. (Pubitemid 126724391)
15. [Rosch etal.1976] E. Rosch, C.Mervis, W. Gray, D. Johnson, and P. Boyes-Braem. Basic objects in natural categories. Cognitive Psychology, 8, 1976.
16. [Salton 1971] G. Salton. The SMART Retrieval System -Experiment in Automatic Document Processing. Prentice-Hall, Englewood Cliffs, New Jersey, 1971.
17. [Stauffer and Grimson2000] C. Stauffer andW. Grimson. Learning patterns of activity using real-time tracking. IEEE PAMI, 22(8):747-757, 2000.
18. [Weinberger etal.1995] M. Weinberger, J. Rissanen, and M. Feder. A universal finite memory source. In IEEE Trans. Inform. Theory, vol. IT-41, pp. 643-652, 48, 1995.
19. [Zhong etal.2004] H. Zhong, J. Shi, and M. Visontai. Detecting unusual activity in video. In In Proc. of IEEE CVPR, 2004.