Data processing: artificial intelligence – Neural network – Learning task
Reexamination Certificate
2006-03-28
2009-11-24
Vincent, David R (Department: 2129)
Data processing: artificial intelligence
Neural network
Learning task
C707S793000
Reexamination Certificate
active
07624081
ABSTRACT:
A community mining system analyzes objects of different types and relationships between the objects of different types to identify communities. The relationships between the objects have an associated time. The community mining system extracts various features related to objects of a designated type from the relationships between objects of different types that represent the evolution of the features over time. The community mining system collects training data that indicates extracted features associated with members of the communities. The community mining system then classifies an object of the designated type as being within the community based on closeness of the features of the object to the features of the training data.
REFERENCES:
patent: 5867799 (1999-02-01), Lang et al.
patent: 6263434 (2001-07-01), Hanna et al.
patent: 6453307 (2002-09-01), Schapire et al.
patent: 6839680 (2005-01-01), Liu et al.
patent: 7457794 (2008-11-01), Weigt et al.
patent: 2001/0037317 (2001-11-01), Freiwirth et al.
patent: 2004/0236576 (2004-11-01), Thiesson et al.
patent: 2005/0177385 (2005-08-01), Hull et al.
patent: 2006/0235810 (2006-10-01), Wen et al.
Nie, Z., Zhang, Y., Wen J. and Ma, W. “Object-Level Ranking: Bringing Order to Web Objects”, WWW 2005, pp. 567-574.
McCallum et al. “Efficient clustering of high-dimensional data sets with application to reference matching”, SIGKDD, 2000, pp. 169-178.
“Social Networks Research Report”, http://tidbit.wildbit.com, 2005.
Zaiane et al. “Discovering Web access patterns and trends by applying OLAP anddata mining technology on Web logs”, Research and Technology Advances in Digital Libraries, 1998, pp. 19-29.
Uzzi, “Social structure and competition in interfirm networks: the paradox of embeddedness”, Administrative Science Quarterly, vol. 42, 1997.
U.S. Appl. No. 11/375,610, filed Mar. 13, 2006, Liu et al.
Adamic, Lada A. and Eytan Adar, “Friends and Neighbors on the Web,” TR HP, 2001, 9 pages.
Allan, James, Courtney Wade and Alvaro Bolivar, “Retrieval and Novelty Detection at the Sentence Level,” SIGIR'03, Jul. 2003, Toronto, Canada, © 2003 ACM, pp. 314-321.
Beeferman, Doug and Adam Berger, “Agglomerative clustering of a search engine query log,” SIGKDD 2000, 10 pages.
Bondy, J.A. and U. S. R. Murty, “Ch.9.2 Dual Graphs,” Graph Theory With Applications, 1976, American Elsevier Publishing Co., Inc., pp. 139-143.
Cai, Deng et al., “Mining Hidden Community in Heterogeneous Social Networks,” LinkKdd'05, Aug. 2005, Chicago, © 2005 ACM, 8 pages.
Chen, Chaomei and Les Carr, “Trailblazing the Literature of Hypertext: Author Co-Citation Analysis (1989-1998),” Hypertext 99, Darmstadt, Germany, © 1999 ACM, pp. 51-60.
Cui, Hang et al., “Probabilistic Query Expansion Using Query Logs,” WWW 2002, May, Honolulu, Hawaii, ACM, pp. 325-332.
Flake, Gary William, Steve Lawrence and C. Lee Giles, “Efficient Identification of Web Communities,” ACM SIGKDD 2000, August, Boston, MA, pp. 150-160.
Fonseca, Carlos M. and Peter J. Fleming, “Multiobjective Optimization and Multiple Constraint Handling with Evolutionary Algorithms I: A Unified Formulation,” Jan. 23, 1995, IEEE TSMC, 40 pages.
Gibson, David, Jon Kleinberg and Prabhakar Raghavan, “Inferring Web Communities from Link Topology,” HyperText 98, Pittsburgh, PA, © 1998 ACM, pp. 225-234.
Hopcroft, John et al., “Natural Communities in Large Linked Networks,” SIGKDD '03, Aug. 2003, Washington, DC, © 2003 ACM, 6 pages.
Ino, Hidehiko, Mineichi Kudo and Atsuyoshi Nakamura, “Partitioning of Web Graphs by Community Topology,” WWW May 2005, Chiba, Japan, ACM, pp. 661-669.
Jeh, Glen and Jennifer Widom, “SimRank: A Measure of Structural-Context Similarity,” SIGKDD, 2002, pp. 1-11.
Joachims, Thorsten, “Making Large-Scale SVM Learning Practical,” Jul. 9, 1998, pp. 41-56.
Joachims, Thorsten, “Optimizing Search Engines using Clickthrough Data,” SIGKDD 2002, Alberta, Canada, © 2002 ACM, 10 pages.
Joachims, Thorsten, “SVMlight Support Vector Machine,” Jul. 20, 2004, 10 pages, http•//www.cs.cornell.edu/People/tj/svm—light/, [last accessed Feb. 20, 2006].
Kautz, Henry, Bert Selman and Mehul Shah, “ReferralWeb: Combining Social Networks and Collaborative Filtering,” Communications of the ACM, vol. 40, No. 3, Mar. 1997, pp. 1-4.
Keogh, Eamonn, “Exact Indexing of Dynamic Time Warping,” In VLDB 2002, Hong Kong, 12 pages.
Kleinberg, Jon M., “Hubs, Authorities, and Communities,” ACM Computing Surveys, vol. 31 (4), Dec. 1999, © 1999 by the Association for Computing Machinery, Inc., 4 pages.
Kumar, Ravi et al., “The Web and Social Networks,” Computer, Nov. 2002, © 2002 IEEE, pp. 32-36.
Kumar, Ravi et al., “Trawling the web for emerging cyber-communities,” 1999, 21 pages.
Li, Wen-Syan et al., “Retrieving and Organizing Web Pages by ‘Information Unit’,” WWW May 2001, Hong Kong, ACM, pp. 230-244.
Li, Xiaoyan and W. Bruce Croft, “Novelty Detection Based on Sentence Level Patterns,” CIKM '05, Oct. 2005, Germany, © 2005 ACM, 8 pages.
Nie, Zaiqing et al., “Object-Level Ranking: Bringing Order to Web Objects,” WWW 2005, Japan, ACM, pp. 567-574.
Popescul, Alexandrin et al., “Clustering and Identifying Temporal Trends in Document Databases,” IEEE Advances in Digital Libraries, ADL 2000, Washington, DC, May 22-24, 2000, pp. 173-182.
Reddy, P. Krishna and Masaru Kitsuregawa, “An approach to build a cyber-community hierarchy,” WISE, 2001, pp. 1-12.
Reddy, P. Krishna and Masaru Kitsuregawa, “An approach to relate the web communities through bipartite graphs,” WISE 2001, pp. 1-10.
Schwartz, Michael F. and David C. M. Wood, “Discovering Shared Interests Among People Using Graph Analysis of Global Electronic Mail Traffic,” Oct. 1992, Communications of the Association for Computing Machinery, 15 pages.
Shi, Jianbo and Jitendra Malik, “Normalized Cuts and Image Segmentation,” Nov. 16, 1999, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, No. 8, Aug. 2000, © 2000 IEEE, pp. 888-905.
Soundararajan, Padmanabhan and Sudeep Sarkar, “Investigation of Measures for Grouping by Graph Partitioning,” In CPR 2001, © 2001 IEEE, pp. 1239-1246.
Sun, Aixin and Ee-Peng Lim, “Web Unit Mining: Finding and Classifying Subgraphs of Web Pages,” In CIKM 2003, New Orleans, © 2003 ACM, 8 pages.
Sun, Jian-Tao et al., “CubeSVD: A Novel Approach to Personalized Web Search,” WWW May 2005, Chiba, Japan, ACM, 9 pages.
Sun, Zhen et al., “Event-Driven Document Selection for Terrorism Information Extraction,” ISI 2005, pp. 1-12.
Toyoda, Masashi and Masaru Kitsuregawa, “Extracting Evolution of Web Communities from a Series of Web Archives,” HT'03, Aug. 2003, United Kingdom, © 2003 ACM, 10 pages.
Wen, Ji-Rong, Jian-Yun Nie and Hong-Jiang Zhang, “Clustering User Queries of a Search Engine,” WWW, May 2001, Hong Kong, ACM, pp. 162-168.
Xue, Gui-Rong et al., “IRC: An Iterative Reinforcement Categorization Algorithm for Interrelated Web Objects,” ICDM 2004, 8 pages.
Xue, Gui-Rong et al., “Optimizing Web Search Using Web Click-through Data,” CIKM, ACM, Nov. 2004, pp. 118 - 126.
Yang, Yiming et al., “Topic-conditioned Novelty Detection,” SIGKDD'02, Alberta, © 2002 ACM, pp. 688-693.
Zhang, Jian, Zoubin Ghahramani, and Yiming Yang, “A Probabilistic Model for Online Document Clustering with Application to Novelty Detection,” NIPS 17, 2005, 8 pages.
Zhou, Wen-Jun et al., “A Concentric-Circle Model for Community Mining in Graph Structures,” Nov. 15, 2002, Microsoft Techn
Liu Tie-Yan
Ma Wei-Ying
Zhao Qiankun
Chang Li-Wu
Microsoft Corporation
Perkins Coie LLP
Vincent David R
LandOfFree
Predicting community members based on evolution of... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Predicting community members based on evolution of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Predicting community members based on evolution of... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4134488