臺灣人文及社會科學引文索引資料庫系統

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：自動鏈結分析演算法在社會網絡之開發與應用
書刊名：資訊管理學報
作者：江憲坤／陳鴻文／楊境榮
作者(外文)：Chiang, Heien-kun／Chen, Hown-wen／Yang, Jing-rong
出版日期：2008
卷期：15:3
頁次：頁157-180
主題關鍵詞：資料探勘；鏈結分析；弱鏈結；關聯法則；Data mining；Link analysis；Weak link；Association rules
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(1) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:1
  • 共同引用共同引用:0
  • 點閱點閱:1
期刊論文
1.Yun, H.、Hwang, D.、Ha, B.、Ryu, K. H.(2003)。Mining Association Rules on Significant Rare Data Using Relative Support。Journal of Systems and Software，67(3)，181-191。  new window
2.Garton, L.、Haythornthwaite, C.、Wellman, B.(1997)。Studying Online Social Networks。Journal of Computer-Medicated Communication，3(1)，124-132。  new window
3.Milgram, Stanley(1967)。The Small-World Problem。Psychology Today，1(1)，61-67。  new window
4.Granovetter, Mark S.(1973)。The Strength of Weak Ties。American Journal of Sociology，78(6)，1360-1380。  new window
5.蕭新煌、龔宜君(19980500)。東南亞臺商與華人之商業網絡關係。華商經貿月刊，381，19-38。  延伸查詢new window
6.Borodin, A.、Roberts, G. O.、Rosenthal, J. S.、Tsaparas, P.(2005)。Link Analysis Ranking: Algorithms, Theory and Experiments。ACM Transactions on Internet Technology，5(1)，231-297。  new window
7.Xu, J. J.、Chen, H. C.(2004)。Fighting Organized Crimes: Using Shortest-Path Algorithms to Identify Associations in Criminal Networks。Decision Support Systems，38(3)，473-487。  new window
8.Watts, Duncan J.、Strogatz, Steven H.(1998)。Collective Dynamics of 'Small-world' Networks。Nature，393(6684)，440-442。  new window
9.Henzinger, M. R.(2001)。Hyperlink analysis for the web。IEEE Internet Computing，5(1)，45-50。  new window
會議論文
1.Brin, S.、Page, L.(1998)。The Anatomy of Large-scale Hypertextual Web Search Engine。The Seventh International World Wide Web Conference，107-117。  new window
2.Agrawal, R.、Imielinski, T.、Swami, A.(1993)。Mining association rules between sets of items in large database。The ACM SIGMOD Conference on Management of Data，207-216。  new window
3.Berry, M. W.、Browne, M.(2005)。Email Surveillance Using Nonnegative Matrix Factorization。Workshop on Link Analysis, Counterterrorism and Security，45-54。  new window
4.Chapanond, A.、Krishnamoorthy, M. S.、Bülent, Y.(2005)。Graph Theoretic and Spectral Analysis of Enron Email Data。Workshop on Link Analysis, Counterterrorism and Security，15-22。  new window
5.Chung, F. L.、Lui, C. L.(2000)。A Post-analysis Framework for Mining Generalized Association Rules with Multiple Minimum Supports。KDD'2000 Workshop on Post-Processing in Machine Learning and Data Mining。  new window
6.Diesner, J.、Carley, K. M.(2005)。Exploration of Communication Networks from the Enron Email Corpus。Workshop on Link Analysis, Counterterrorism and Security，3-14。  new window
7.Duan, Y.、Wang, J.、Kam, M.、Canny, J.(2005)。A Secure Online Algorithm for Link Analysis on Weighted Graph。Workshop on Link Analysis, Counterterrorism and Security，71-81。  new window
8.Keila, P. S.、Skillicorn, D. B.(2005)。Structure in the Enron Email Dataset。Workshop on Link Analysis, Counterterrorism and Security，55-64。  new window
9.Lauw, H. W.、Lim, E. P.、Tan, T. T.、Pang, H. H.(2005)。Mining Social Network from Spatio-Temporal Events。Workshop on Link Analysis, Counterterrorism and Security，82-93。  new window
10.Liu, B.、Hsu, W.、Ma, Y.(1999)。Mining Association Rules with Multiple Minimum Supports。The 1999 International Conference on Knowledge Discovery and Data Mining，337-341。  new window
11.McCallum, A.、Corrada-Emmanuel, A.、Wang, X.(2005)。The Author-Recipient-Topic Model for Topic and Role Discovery in Social Networks, with Application to Enron and Academic Email。Workshop on Link Analysis, Counterterrorism and Security，33-44。  new window
12.Priebe, C.(2005)。Scan Statistics on Enron Graphs。Workshop on Link Analysis, Counterterrorism and Security，23-32。  new window
13.Shetty, K.、Adibi, J.(2005)。Discovering Important Nodes through Graph Entropy the Case of Enron Email Database。3rd International Workshop on Link Discovery。ACM Press。  new window
學位論文
1.吳寶秀(1990)。台灣製造業員工個人社會網絡分析(碩士論文)。東海大學。  延伸查詢new window
圖書
1.Diestel, Reinhard(2000)。Graph Theory。Springer-Verlag。  new window
2.Wasserman, S.、Faust, K.(1997)。Social Network Analysis: Methods and Applications。Cambridge University Press。  new window
3.Cormen, T. H.、Leiserson, C. E.、Rivest, R. L.、Stein, C.(2001)。Introduction to Algorithms。MIT Press。  new window
4.Berry, M. J. A.、Linoff, G.(1997)。Data Mining Techniques: For Marketing, Sale, and Customer Support。John Wiley & Sons Inc.。  new window
5.Knoke, D.、Kuklinski, J. H.(1982)。Network analysis。Beverly Hills, CA：Sage Publications。  new window
6.Westphal, C. R.、Blaxton, T.(1998)。Data mining solutions。New York：Wiley。  new window
7.胡守仁(2002)。連結：混沌、複雜之後，最具開創性的小世界理論。天下文化。  延伸查詢new window
8.陳會安(2002)。資料結構理論與實務。學貫行銷。  延伸查詢new window
9.Adriaans, P.、Zantinge, D.(1999)。Data Mining。Addison-Wesley。  new window
10.Valiente, G.(2002)。Algorithms on Trees and Graphs。Springer。  new window
11.Weiss, M. A.(1993)。Data Structures and Algorithm Analysis in C。Addison-Wesley。  new window
其他
1.Berkeley(2006)。UC Berkeley Enron Email Analysis Project，http://bailando.sims.berkeley.edu/enron_email.html。  new window
2.Biconnected(2003)。Biconnected Component Partition，http://csci.biola.edu/csci480spring03/biconnectedComponents.pdf。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

臺灣人文及社會科學引文索引資料庫

目前上線人數：1276（臺灣：1267，外國：9） ／ 本年度總使用人次：2516201 ／ 訪客人次（自102年09月）：68332658
國家圖書館著作權聲明 Copyright © 2013 All rights reserved.
本館地址: 100201臺北市中山南路20號． 本館地圖及交通資訊．
總機：(02)23619132．最佳瀏覽解析度為1024x768以上