PageRank能够发掘重要的实体, 社区发掘(community detection)可以找到具有某种特性的群体，紧密度中心性算法(Closeness Centrality)可以自动找到远离群体的个体。所有这些算法都是非监督的学习。 我们分享一些具体客户案例来展示他们的价值，同时分享怎样在大数据上灵活应用这些开源算法。
Mingxi Wu is the vice president of engineering at TigerGraph, a Silicon Valley-based startup building a world-leading real-time graph database. Over his career, Mingxi has focused on database research and data management software. Previously, he worked in Microsoft’s SQL Server group, Oracle’s Relational Database Optimizer group, and Turn Inc.’s Big Data Management group. Lately, his interest has turned to building an easy-to-use and highly expressive graph query language. He has won research awards from the most prestigious publication venues in database and data mining, including SIGMOD, KDD, and VLDB and has authored five US patents with three more international patents pending. Mingxi holds a PhD from the University of Florida, specializing in both database and data mining.
Help us make this conference the best it can be for you. Have questions you'd like this speaker to address? Suggestions for issues that deserve extra attention? Feedback that you'd like to share with the speaker and other attendees?
Join the conversation here (requires login)
©2019, O'Reilly Media, Inc. • (800) 889-8969 or (707) 827-7019 • Monday-Friday 7:30am-5pm PT • All trademarks and registered trademarks appearing on oreilly.com are the property of their respective owners. • firstname.lastname@example.org