@article {14485,
	title = {Eighth workshop on mining and learning with graphs},
	journal = {SIGKDD Explor. Newsl.},
	volume = {12},
	year = {2011},
	month = {2011/03//},
	pages = {63 - 65},
	abstract = {The Eighth Workshop on Mining and Learning with Graphs (MLG)1was held at KDD 2010 in Washington DC. It brought together a variete of researchers interested in analyzing data that is best represented as a graph. Examples include the WWW, social networks, biological networks, communication networks, and many others. The importance of being able to effectively mine and learn from such data is growing, as more and more structured and semi-structured data is becoming available. This is a problem across widely different fields such as economics, statistics, social science, physics and computer science, and is studied within a variety of sub-disciplines of machine learning and data mining including graph mining, graphical models, kernel theory, statistical relational learning, etc. The objective of this workshop was to bring together practitioners from these various fields and areas to foster a rich discussion of which problems we work on, how we frame them in the context of graphs, which tools and algorithms we apply and our general findings and lessons learned. This year{\textquoteright}s workshop was very successful with well over 100 attendees, excellent keynote speakers and papers. This is a rapidly growing area and we believe that this community is only in its infancy. We hope that the readers will join us next year for MLG 2011.},
	keywords = {data mining, dynamic network analysis, graph mining, kernel methods, link mining, machine learning, network analysis, pattern recognition, relational learning, scalable graph mining, statistical relational learning},
	isbn = {1931-0145},
	doi = {10.1145/1964897.1964915},
	url = {http://doi.acm.org/10.1145/1964897.1964915},
	author = {Brefeld,Ulf and Getoor, Lise and Macskassy,Sofus A.}
}
@conference {14450,
	title = {Preserving the privacy of sensitive relationships in graph data},
	booktitle = {Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD},
	series = {PinKDD{\textquoteright}07},
	year = {2008},
	month = {2008///},
	pages = {153 - 171},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	address = {Berlin, Heidelberg},
	abstract = {In this paper, we focus on the problem of preserving the privacy of sensitive relationships in graph data. We refer to the problem of inferring sensitive relationships from anonymized graph data as link reidentification. We propose five different privacy preservation strategies, which vary in terms of the amount of data removed (and hence their utility) and the amount of privacy preserved. We assume the adversary has an accurate predictive model for links, and we show experimentally the success of different link re-identification strategies under varying structural characteristics of the data.},
	keywords = {anonymization, graph data, identification, link mining, noisy-or, privacy, social network analysis},
	isbn = {3-540-78477-2, 978-3-540-78477-7},
	url = {http://dl.acm.org/citation.cfm?id=1793474.1793485},
	author = {Zheleva,Elena and Getoor, Lise}
}
@conference {14442,
	title = {Is there a grand challenge or X-prize for data mining?},
	booktitle = {Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining},
	series = {KDD {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {954 - 956},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This panel will discuss possible exciting and motivating Grand Challenge problems for Data Mining, focusing on bioinformatics, multimedia mining, link mining, text mining, and web mining.},
	keywords = {Bioinformatics, data mining, grand challenge, image mining, link mining, multimedia mining, text mining, video mining, web mining, X-prize},
	isbn = {1-59593-339-5},
	doi = {10.1145/1150402.1150535},
	url = {http://doi.acm.org/10.1145/1150402.1150535},
	author = {Piatetsky-Shapiro,Gregory and Grossman,Robert and Djeraba,Chabane and Feldman,Ronen and Getoor, Lise and Zaki,Mohammed}
}
