Full metadata record
DC FieldValueLanguage
dc.contributor.authorGau, Rung-Hungen_US
dc.contributor.authorTsai, Sheng-Wenen_US
dc.contributor.authorTseng, Tzu-Tingen_US
dc.date.accessioned2015-12-02T03:00:55Z-
dc.date.available2015-12-02T03:00:55Z-
dc.date.issued2013-01-01en_US
dc.identifier.isbn978-1-4799-1353-4en_US
dc.identifier.issn1930-529Xen_US
dc.identifier.urihttp://hdl.handle.net/11536/128553-
dc.description.abstractIn this paper, we propose a novel approach for the analysis of large-scale mobile telecommunications social networks. To search for alpha users that are essential for social marketing, we propose using both graph theory and linear algebra. In particular, we first look for all trusses in a social graph based on graph theory and then find out alpha users in the trusses based on linear algebra. While there is no proof that the adjacency matrix of a graph always has strictly positive eigenvectors, we prove that the adjacency matrix of a truss always has positive eigenvectors. The proposed approach is scalable and can be used to analyze massive networks.en_US
dc.language.isoen_USen_US
dc.subjectsocial network analysisen_US
dc.subjectalpha usersen_US
dc.subjectgraph theoryen_US
dc.subjectlinear algebraen_US
dc.titleSearching for Truss Alpha Users in Mobile Telecommunications Social Networksen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2013 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)en_US
dc.citation.spage3072en_US
dc.citation.epage3076en_US
dc.contributor.department電機工程學系zh_TW
dc.contributor.departmentDepartment of Electrical and Computer Engineeringen_US
dc.identifier.wosnumberWOS:000357299603027en_US
dc.citation.woscount0en_US
Appears in Collections:Conferences Paper