ACM Home Page
Please provide us with feedback. Feedback
Computable social patterns from sparse sensor data
Full text PdfPdf (616 KB)
Source
ACM International Conference Proceeding Series; Vol. 300 archive
Proceedings of the first international workshop on Location and the web table of contents
Beijing, China
Pages 69-72  
Year of Publication: 2008
ISBN:978-1-60558-160-6
Authors
Dinh Phung  Curtin University of Technology, Western Australia
Brett Adams  Curtin University of Technology, Western Australia
Svetha Venkatesh  Curtin University of Technology, Western Australia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 41,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1367798.1367810
What is a DOI?

ABSTRACT

We present a computational framework to automatically discover high-order temporal social patterns from very noisy and sparse location data. We introduce the concept of social footprint and present a method to construct a codebook, enabling the transformation of raw sensor data into a collection of social pages. Each page captures social activities of a user over regular time period, and represented as a sequence of encoded footprints. Computable patterns are then defined as repeated structures found in these sequences. To do so, we appeal to modeling tools in document analysis and propose a Latent Social theme Dirichlet Allocation (LSDA) model -- a version of the Ngram topic model in [6] with extra modeling of personal context. This model can be viewed as a Bayesian clustering method, jointly discovering temporal collocation of footprints and exploiting statistical strength across social pages, to automatically discovery high-order patterns. Alternatively, it can be viewed as a dimensionality reduction method where the reduced latent space can be interpreted as the hidden social 'theme' -- a more abstract perception of user's daily activities. Applying this framework to a real-world noisy dataset collected over 1.5 years, we show that many useful and interesting patterns can be computed. Interpretable social themes can also be deduced from the discovered patterns.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
B. Adams, D. Phung, and S. Venkatesh. Sensing and using social context. ACM Transaction on Multimedia Computing, Communications and Applications, 2008. to appear.
 
2
 
3
N. Eagle and A. Pentland. Eigenbehaviors: Identifying Structure in Routine, October 2005. Technical report, Human Dynamics Lab, Massachusetts Institute of Technology (MIT), 2005.
 
4
R. Hariharan and K. Toyama. Project lachesis: Parsing and modeling location histories. Lecture Notes in Computer Science, 3234:106--124, 2004.
 
5
 
6
Xuerui Wang, Andrew McCallum, and Xing Wei. Topical n-grams: Phrase and topic discovery, with an application to information retrieval. In Proceedings of the 7th IEEE International Conference on Data Mining, pages 697--702, 2007.

Collaborative Colleagues:
Dinh Phung: colleagues
Brett Adams: colleagues
Svetha Venkatesh: colleagues