本論文針對兩個階層資料共同含有的元素進行分析的工作任務(Task)，參考現代最先進的集合交集視覺化方法，針對視覺化表達資料的集合特別是階層關係，集合與元素的屬性瀏覽強化，應用到分析社群媒體使用者活動資料分析，找出關鍵的使用者和行為。我們以多視圖呈現和互動操作互相串聯達成以下目標，瀏覽粉絲專頁的貼文與使用者資料，比較粉絲專頁間的使用者活動情形，觀察重疊活動使用者的活動情形，查詢粉絲專頁的貼文與使用者資料細節。根據資料的特性，以階層化視覺化方法表現階層化的集合關係，以及專注在發生交集的元素呈現概覽，達成可靠的可擴展性。最後比較目前最先進的集合交集視覺化方法支援的工作任務、可擴展性討論我們系統的優點和限制，最後提出未來能精進的研究方向。

Analyzing the common elements belong to the two collections of hierarchical data is the critical task of our work. According to the state of the art intersection visualization method, we enhance the visual expression of data, especially for the hierarchical relationship, set/element attribute exploration, and apply our approach on social media to identify key users and behaviors by user activity data analysis. We use multi-view visualization and interaction to achieve the following goals: browse the posts and user profiles of pages(set of posts), compare user activity between pages, observe the activities of the intersection users, and highlight the detail information of posts and user profiles. According to the characteristics of the data, the hierarchical visualization method such as Sunburst and Treemap is used to represent the hierarchical relationship, and focus on presenting the intersection elements only to achieve reliable scalability. Finally, we compare the work tasks and scalability supported by the state of the art set visualization method, discuss the advantages and limitations of our work, and conclude the research direction that can be refined in the future.

[1] M. Bastian, S. Heymann, M. Jacomy et al., “Gephi: an open source software for exploring and manipulating networks.” 2009.
[2] D. Hansen, B. Shneiderman, and M. A. Smith, Analyzing social media networks with NodeXL: Insights from a connected world. Morgan Kaufmann, 2010.
[3] V. Batagelj and A. Mrvar, “Pajek-program for large network analysis,” Connections, vol. 21, no. 2, pp. 47–57, 1998.
[4] J. Heer, M. Bostock, and V. Ogievetsky, “A tour through the visualization zoo,” Queue, vol. 8, no. 5, p. 20, 2010.
[5] H.-J. Schulz, “Treevis. net: A tree visualization reference,” IEEE Computer Graphics and Applications, vol. 31, no. 6, pp. 11–15, 2011.
[6] B. Shneiderman and C. Plaisant, “Treemaps for space-constrained visualization of hierar- chies,” 1998.
[7] N. Kong, J. Heer, and M. Agrawala, “Perceptual guidelines for creating rectangular treemaps,” IEEE transactions on visualization and computer graphics, vol. 16, no. 6, pp. 990–998, 2010.
[8] J. Stasko and E. Zhang, “Focus+context display and navigation techniques for enhancing radial, space-filling hierarchy visualizations,” in Proceedings of the IEEE Symposium on Information Vizualization 2000, ser. INFOVIS ’00. Washington, DC, USA: IEEE Com- puter Society, 2000, pp. 57–65.
[9] J. Stasko, R. Catrambone, M. Guzdial, and K. McDonald, “An evaluation of space-filling information visualizations for depicting hierarchical structures,” International journal of human-computer studies, vol. 53, no. 5, pp. 663–694, 2000.
[10] R. Boardman, “Bubble trees the visualization of hierarchical information structures,” in CHI’00 extended abstracts on Human factors in computing systems. ACM, 2000, pp. 315–316.
[11] M. Schwab, H. Strobelt, J. Tompkin, C. Fredericks, C. Huff, D. Higgins, A. Strezhnev, M. Komisarchik, G. King, and H. Pfister, “booc. io: An education system with hierarchical concept maps and dynamic non-linear learning plans,” IEEE transactions on visualization and computer graphics, vol. 23, no. 1, pp. 571–580, 2017.
[12] B. Alsallakh, L. Micallef, W. Aigner, H. Hauser, S. Miksch, and P. Rodgers, “Visualizing Sets and Set-typed Data: State-of-the-Art and Future Challenges,” in EuroVis - STARs, R. Borgo, R. Maciejewski, and I. Viola, Eds. The Eurographics Association, 2014.
[13] A. Lex, N. Gehlenborg, H. Strobelt, R. Vuillemot, and H. Pfister, “Upset: visualization of intersecting sets,” IEEE transactions on visualization and computer graphics, vol. 20, no. 12, pp. 1983–1992, 2014.
[14] B. Alsallakh and L. Ren, “Powerset: A comprehensive visualization of set intersections,” IEEE transactions on visualization and computer graphics, vol. 23, no. 1, pp. 361–370, 2017.
[15] J. Fuchs, P. Isenberg, A. Bezerianos, and D. Keim, “A systematic review of experimen- tal studies on data glyphs,” IEEE Transactions on Visualization and Computer Graphics, vol. 23, no. 7, pp. 1863–1879, 2017.
[16] R. Borgo, J. Kehrer, D. H. Chung, E. Maguire, R. S. Laramee, H. Hauser, M. Ward, and M. Chen, “Glyph-based visualization: Foundations, design guidelines, techniques and ap- plications.” in Eurographics (STARs), 2013, pp. 39–63.
[17] J. Fuchs, F. Fischer, F. Mansmann, E. Bertini, and P. Isenberg, “Evaluation of alternative glyph designs for time series data in a small multiple setting,” in Proceedings of the SIGCHI conference on human factors in computing systems. ACM, 2013, pp. 3237–3246.
[18] J. Fuchs, P. Isenberg, A. Bezerianos, F. Fischer, and E. Bertini, “The influence of contour on similarity perception of star glyphs,” IEEE transactions on visualization and computer graphics, vol. 20, no. 12, pp. 2251–2260, 2014.
[19] ptt-web-crawler is a crawler for the web version of ptt @ONLINE. [Online]. Available: https://github.com/jwlin/ptt-web-crawler
[20] S. Tilkov and S. Vinoski, “Node. js: Using javascript to build high-performance network programs,” IEEE Internet Computing, vol. 14, no. 6, pp. 80–83, 2010.
[21] J. Sun, “􏰲jieba􏰳chinese word segmentation tool,” 2012.
[22] M. Bostock, V. Ogievetsky, and J. Heer, “D3 data-driven documents,” IEEE transactions on visualization and computer graphics, vol. 17, no. 12, pp. 2301–2309, 2011.