English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 112721/143689 (78%)
Visitors : 49604159      Online Users : 565
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 資訊管理學系 > 學位論文 >  Item 140.119/63652
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/63652


    Title: 投資者的社群行為
    Social Behavior of Investors
    Authors: 梁煜銜
    Liang, Yuxian Eugene
    Contributors: 苑守慈
    Yuan, Soe Tysr
    梁煜銜
    Liang, Yuxian Eugene
    Keywords: 社群網路分析
    連節預測
    機器學習
    social network analysis
    link prediction
    machine learning
    Date: 2013
    Issue Date: 2014-02-10 14:48:28 (UTC+8)
    Abstract: “在當今世界,社會結構就是一切,這(臉譜)是的東西。 ”
     〜肖恩·帕克,由安德魯·加菲爾德在社交網絡發揮
    我們生活在一個社會的世界。文化,社會對組織影響力,它的社交網絡,無論是內部和外部。我們知道,社會結構多麼強大:從影響的思想,文化和社會規範,以種族和階層的人的刻板印象。我們也每天都看到社交網絡的影響力,從互聯網到我們的日常生活。
    早前,我們做了一個有趣的觀察基於啟發式:為什麼人們誰是當前學生或校友的長青藤聯盟或其他受歡迎的學校往往在生活中做的很好?無論是在商業,政治等。我們進一步思考這個問題,並注意到一個有趣的趨勢:具體的學校歷屆畢業生必須投資於初創他們的後輩開始的強烈傾向。
    例子是豐富,尤其是在常青藤大學的地位的情況下:谷歌收到了他們的天使資金來自安迪Bechtosheim , Sun微系統的聯合創始人和博士在斯坦福大學的電子工程;雅虎的早期幾輪融資分別由邁克爾·莫里茨紅杉資本,賓夕法尼亞大學的校友。 Facebook的天使投資是由彼得·泰爾,是斯坦福大學的校友。
    這是巧合?還是有其他的力量在起作用?如一個老同學,同學關係網?在本研究中,我們試圖理解這些趨勢,並建立預測模型。
    “In a world where social structure is everything, this (Facebook) was the thing.”
    ~ Sean Parker , played by Andrew Garfield in The Social Network
    We live in a social world. Cultures, societies to organizations are influenced by it’s social network, be it internally and externally. We know how powerful social structures are: from influencing thoughts, cultural and social norms to stereotyping of races and class of people. We also see the influence of social networks everyday, from the Internet to our daily life.
    Sometime ago, we made an interesting observation based on heuristics: why do people who were current students or alumni’s of Ivy Leagues or other popular schools tend to do well in life? Be it in businesses, politics and so on. We further think through this issue and noticed an interesting trend: alumnis of specific schools have a strong tendency to invest in startups started by their juniors.
    Examples are aplenty, especially in the case of universities of Ivy League status: Google received their angel funding from Andy Bechtosheim, co-founder of Sun Microsystems and PhD in Stanford’s electrical engineering; Yahoo!’s early financing rounds was led by Michael Moritz of Sequoia Capital, alumni of University of Pennsylvania. Facebook’s angel investment was made by Peter Thiel, a Stanford alumni.
    Are these coincidences? Or are there other forces at work? Such as an old school-boy network? In this research, we sought to understand these trends and build a predictive model.
    Reference: 1. Adamic, L. A and Ada, E.. “Friends and Neighbors on the Web”. Social Networks, Vol. 25, No. 3, pp 211-230, 2001
    2. Backstrom, L., Boldi P., Rosa, M., Ugander, J., Vigna, S.. “ Four Degrees of Separation” Retrieved from http://arxiv.org/abs/1111.4570v3 on April 2011.
    3. Backstrom, L., Leskovec, J., “Supervised Random Walks: Predicting and Recommending Links in Social Networks”, ACM International Conference on Web Search and Data Mining (WSDM), Hong Kong, China, 2011
    4. Bakker, L., Hare, W., Khosravi, H. and Ramadanovic, B. “A social network model of investment behavior in the stock market.” Physica A: Statistical Mechanics and its Applications, Vol. 389 No. 6, pp 1223-1229, 2010.
    5. Barnea, A., Cronqvist, H.and Siegel, S.. “Nature or Nurture: what determines investor behavior?”. Journal of Financial Economics, Vol. 98, No 3,, pp 583–604, 2010
    6. Breiman, L., Friedman, J., Olshen, R., and Stone, C. “Classification and Regression Trees.” Wadsworth, Belmont, CA, 1984.
    7. Chang, C.C., and Lin, C.J., “LIBSVM: A Library for Support Vector Machines”, Department of Computer Science, National Taiwan University, Taipei, Taiwan. April 2012
    8. Cortes, C., and Mohri, M., “AUC optimization vs. error rate minimization.” Proceedings of the Advances in Neural Information Processing Systems (NIPS’2003). British Columbia, Canada.
    9. Dean, J. and Ghemawat, S., “MapReduce: Simplified Data Processing on Large Clusters” OSDI 2004. Sixth Symposium on Operating System Design and Implementation, San Francisco, CA, December 2004
    10. Fire, M., Tenenboim, Lena., Lesser, O., Puzis, Rami., Rokach, L., and Elovici Y., “Link Prediction in Social Networks using Computationally Efficient Topological Features”, Third IEEE International Conference on Social Computing, SocialCom. MIT, Boston, USA, 2011
    11. Freeman, L. C., “Centrality in Social Networks Conceptual Clarification”, Social Networks, Vol. 79, Vol. 1, No. 3, pp 215 – 239, 1979
    12. Friedkin, N., “Horizon of Observability and Limits of Informal Control in Organizations”, Social Forces, Vol. 62, No. 1, pp 54-77, 1983
    13. Gallagher, B., Tong H., Eliassi-Rad, T., and Faloutsos, C., “Using ghost edges for classification in sparsely labeled networks”, ACM SIGKDD Conference on Knowledge Discovery and Data Mining Conference, Las Vegas, Nevada, USA, 2008
    14. Ghemawat, S., Gobioff, H., and Lueng, S. T., “The Google File System”, 19th ACM Symposium on Operating Systems Principles, Lake George, NY, October 2003
    15. Giot, P., Hege, U., Schwienbaher, A., “Expertise of Reputation? The Investment Behavior of Novice and Experienced Private Equity Funds.” 29th International Conference of the French Finance Association (AFFI), March 2012.
    16. Girvan, M., and Newman, M. E. J., “Community structure in social and biological networks”, PNAS, Volume 99, No. 12, 11, pp 7821-7826 , June 2002
    17. Granovetter, M. S., “The Strength of Weak Ties”, American Journal of Sociology, Vol. 78, No. 6, May 1973
    18. Grinblatt, M., and Keloharju, M., “The Investment Behavior and performance of various investor types: a study of Finland’s unique dataset.” Journal of Financial Economics, Vol. 55, No. 1, pp 43-67, January 2000.
    19. Hevener, A. R., March, S. T., and Park, J., “Design Science in Information Systems Research”, MIS Quarterly, Vol 28, No 1, pp 75-105, March 2004
    20. Hwang, W., Kim, T., Ramanathan, M., and Zhang, A., “Bridging Centrality: Graph Mining from Element Level to Group Level”, Knowledge Discovery and Data Mining Conference, Las Vegas, Nevada, USA, 2008.
    21. James, S. D., David R. P., Wright, C., “Confidence opinions of market efficiency, and Investment Behavior of Finance Professors”, Journal of Financial Markets, Vol. 13, No. 1, pp 174-195, February 2010
    22. Kajdanowicz, T., Kazienko, P., and Doskocz P., “Label-dependent feature extraction in social networks for node Classification”, Social Informatics: Second International Conference, SocInfo, Vol. 64, No. 30, pp 89-102, 2010
    23. Kargar, M., and An A., “Discovering Top-k Teams of Experts with/without a Leader in Social Networks”, ACM Conference on Information and Knowledge Management, Glasgow, Scotland, UK, 2011.
    24. Kempe, D., Kleinberg, J., and Tardos, E., “Maximizing the spread of influence through a social network”, ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington DC. USA, 2003
    25. Kleinberg J., “Authoritative Sources in a Hyperlinked Environment”, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. San Francisco, California. USA, 1998.
    26. Lappas, T., Liu, K., and Terzi, E., “Finding a Team of Experts in Social Networks”, ACM SIGKDD Conference on Knowledge Discovery and Data Mining Conference Paris, France, 2009
    27. Leskovec, J., Huttenlocher, D., Kleinberg, J., “Predicting Positive and Negative Links in Online Social Networks”. ACM WWW International Conference on World Wide Web (WWW), Raleigh, North Carolina, April 2010
    28. Leskovec, J., Huttenlocher, D., Kleinberg Jon., “Signed Networks in Social Media” by. ACM SIGCHI Conference on Human Factors in Computing Systems (CHI), 2010. Atlanta, GA, USA.
    29. Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Briesen, Jeanne, V., and Glance, N., “Cost-effective outbreak detection in networks”, ACM SIGKDD Conference on Knowledge Discovery and Data Mining Conference , San Jose, California, USA, 2007
    30. Li, R. on “The Development of China’s Silicon Valley.”, Entrepreneurial Thought Leaders Lecture Series, September 23rd 2009. http://ecorner.stanford.edu/authorMaterialInfo.html?mid=2287. Retrieved on September 2012.
    31. Liang, Y. E., and Yuan, S. T., “The Social Behavior of Investors”, IEEE/ACM Advances in Social Network Analysis and Mining, Istanbul Turkey. August 2012
    32. Liben-Nowell, D., and Kleinberg J., “The Link Prediction Problem for Social Networks.” Journal of the American Society for Information Science and Technology, Vol. 58, No. 7, pp 1019 - 1031, May 2007.
    33. Manning, C.D., Raghavan, P., and Schütze, H., “Introduction to Information Retrieval. Cambridge University Press”, pp. 234-265., 2008.
    34. McPherson M., Smith-Lovin L., Cook, J. M., “Birds of a Feather: Homophily in Social Networks”, Annual Review of Sociology, Vol. 27, pp 415-444, August 2001
    35. Newman, M E. J., “The Structure of Collaborative Network.” www.pnas.orgycgiydoiy10.1073ypnas.021544898. Retrieved on March 2012.
    36. Newman, M. E. J., “Clustering and preferential attachment in growing networks”, Physical Review, Vol. 64, No. 2, April 2001
    37. Newman, M. E. J., “The Structure and function of complex networks”, SIAM Review 45, pp 167- 256, 2003
    38. Newman, M. E. J., “Modularity and community structure in networks”, PNAS, Volume 103, No. 23, pp 8577-8582, 6 June 2006
    39. Page, L. and Brin, S., “The Anatomy of a large-scale hypertextual web search engine”, Proceedings of the Seventh International Conference on World Wide Web, Brisbane, Australia, 1998.
    40. Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., and Barabasi, A. L., “Hierarchical Organization of Modularity in Metabolic Networks”, Science Magazine, Vol. 297, No. 5586, pp 1551-1555, 30 August 2002
    41. Tan, W. K., Tan, Y. J. “An exploratory investigation of the investment information search behavior of individual domestic investors.” Telematics and Informatics, Vol. 29, No. 2, , pp 187-203, May 2012
    42. Travers J., and Milgram S., “An experimental study of the small world problem”, Sociometry, Vol. 32, No 4, pp 425-443, December 1969
    43. Tung. W. F., and Yuan, S. T., “Intelligent Service Machine”, Communications of the ACM, Vol.58, No.3, pp 129-134, 2010
    44. Xiang, G., Zheng, Z., Wen, M., Hong, J., Rose, C., and Liu C., “A Supervised Approach to Predict Company Acquisition with Factual and Topic Features Using Profiles and News Articles on TechCrunch.” Sixth International AAAI Conference on Weblogs and Social Media, Trinity College, Dublin, Ireland, 2012
    Description: 碩士
    國立政治大學
    資訊管理研究所
    100356020
    102
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0100356020
    Data Type: thesis
    Appears in Collections:[資訊管理學系] 學位論文

    Files in This Item:

    File SizeFormat
    602001.pdf3248KbAdobe PDF2530View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback