Material Detail

Connectivity Structure of Bipartite Graphs via the KNC-Plot

Connectivity Structure of Bipartite Graphs via the KNC-Plot

This video was recorded at First ACM International Conference on Web Search and Data Mining - WSDM 2008. WSDM (pronounced "wisdom") is a brand new ACM conference intended to be complementary to the World Wide Web Conference tracks in search and data mining. The pace of innovation in these areas has reached a level that requires more than one premier annual venue. Specifically, substantial work is currently being done in the areas of workload-driven crawling and monitoring, security and privacy, user profiling, personalized search and ranking, Web advertising, social media analysis, and spam detection. The goal is to make WSDM a focused meeting with a single research paper session through 2-3 days. Appropriately enough, the first WSDM conference is being held at Stanford University in the heart of Silicon Valley, home to many of the world's leading search engines and the people who built them. Stanford is a beautiful venue, and we hope that the physical proximity to many search-focused companies will encourage an active exchange of ideas between participants from academia and industry. WSDM is being co-sponsored by ACM SIGIR, SIGKDD, SIGMOD, and SIGWEB. We thank our industrial sponsors, Google, Microsoft, and Yahoo!, for their generous financial contributions.

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.