Close

KDD 2008 - Day 3 & 4.

Day 3 started with Invited Talk of Dr. Michael Schwarz from Yahoo! Research on “Internet Advertising and Optimal Auction Design” who discussed Generalized English Auctions  and Internet advertising, generalized second price options. (Details can be read on Akshay Java’s Social Media research blog here). It was an interesting talk pertaining to how almost every transaction…

Share

Call for Volunteers - SoCal Code Camp Oct 25-26.

Greetings Southern California .NET Community I was wondering if any of you would be able to volunteer to help register speakers, attendees, & help with general organization, etc. on the Code Camp event days (Saturday/Sunday October 25/26). I am heading up Volunteer Coordination so if you are available please contact me directly () and put…

Share

KDD 2008 Day 2

Day 2 started with Trever Hastie’s talk on regularization paths and coordinate descent.  It was great to see Dr. Hastie passionately speaking about the coordinate descent, logistic regression and fitting.  The keynote’s topic was “Regularization Paths and Coordinate Descent” and following is a brief abstract from the talk. "In a statistical world faced with an…

Share

MSDN Webcast: geekSpeak: REST and Windows Communication Foundation 3.5 with Adnan Masood (Level 200)

I'll be doing a webcast on 3rd September on geekspeak. The topic is "REST and Windows Communication Foundation 3.5". Details are as follows. MSDN Webcast: geekSpeak: REST and Windows Communication Foundation 3.5 with Adnan Masood (Level 200)  Audience(s):     Developer.   Duration:     60 MinutesStart Date:     Wednesday, September 03, 2008 12:00 PM Pacific Time (US…

Share

ACM's KDD 2008 Conference – Day 1 Proceedings

ACM's KDD 2008 is the annual premier international forum for data mining researchers and practitioners from academia, industry, and government to share their ideas, research results and experiences. This year this event was held in Loews Lake Las Vegas resort where Jeff Bergman and I attended it. Details of the program can be found here…

Share