Director of Engineering and Content Science at Yahoo Formerly:
Education:
Recent publications: - P. Biyani, C. Akkaya, and K. Tsioutsiouliklis. Identifying Domain Independent Update Intents in Task Based Dialogs. Proceedings of the SIGDIAL 2018 Conference, pages 410-419, Melbourne, Australia, 12-14 July 2018.
- S. Stergiou, D. Rughwani, and K. Tsioutsiouliklis. Shortcutting Label Propagation for Distributed Connected Components. The 11th ACM International Conference on Web Search and Data Mining. WSDM, 2018.
- S. Banerjee and K. Tsioutsiouliklis. Relation Extraction using Multi-Encoder LSTM Network on a Distant Supervised Dataset. The 12th IEEE International Conference on Semantic Computing. ICSC, 2018.
- S. Stergiou, Z. Straznickas, R. Wu, and K. Tsioutsiouliklis. Distributed Negative Sampling for Word Embeddings. Proceedings of Association for the Advancement of Artificial Intelligence. AAAI, 2017.
- N. Panagiotou, C. Akkaya, K. Tsioutsiouliklis, V. Kalogeraki, D. Gunopulos. First Story Detection using Entities and Relations. 26th International Conference on Computational Linguistics. COLING, 2016.
- S. Banerjee, P. Biyani, and K. Tsioutsiouliklis. Transforming Chatbot Responses to Mimic Domain-specific Linguistic Styles. Workshop on Chatbots and Conversational Agents. WOCHAT, 2016.
- P. Biyani, K. Tsioutsiouliklis, and J. Blackmer. "8 Amazing Secrets for Getting More Clicks": Detecting Clickbaits in News Streams Using Article Informality. Proceedings of Association for the Advancement of Artificial Intelligence. AAAI, 2016.
- S. Stergiou and K. Tsioutsiouliklis. Set Cover at Web Scale. Conference on Knowledge Discovery and Data Mining. KDD, 2015.
Some older publications: - H. Han, E. Manavoglou, H. Zha, K. Tsioutsiouliklis, C.L. Giles, Rule-based Word Clustering for Document Metadata Extraction, Proceedings of the 20th Annual ACM Symposium on Applied Computing, Special Track on Information Access and Retrieval (SAC-IAR'05), 2005.
- G.W. Flake, R.E. Tarjan, K. Tsioutsiouliklis, Graph Clustering and Minimum Cut Trees, J. of Internet Mathematics.
- G. Pant, K. Tsioutsiouliklis, J. Johnson, and C.L. Giles, Panorama: Extending Digital Libraries with Topical Crawlers, Proceedings of ACM/IEEE Joint Conference on Digital Libraries (JCDL 2004), Tucson, Arizona, June 7-11, 2004.
- H. Han, C.L. Giles, H. Zha, C. Li, and K. Tsioutsiouliklis. Two Supervised Learning Approaches for Name Disambiguation in Author Citations, to appear in Proceedings of ACM/IEEE Joint Conference on Digital Libraries (JCDL 2004), Tucson, Arizona, June 7-11, 2004.
- J. Johnson, K. Tsioutsiouliklis, C.L. Giles, Evolving Strategies for Focused Web Crawling, Proc. of the 20th International Conference on Machine Learning (ICML), Washington, DC, 2003.
- M. Hindman, K. Tsioutsiouliklis, J.A. Johnson, "Googlearchy": How a Few Heavily-Linked Sites Dominate Politics on the Web, Annual Meeting of the Midwest Political Science Association, Chicago, IL, April 3-6 2003.
- K. Tsioutsiouliklis, Maximum Flow Techniques for Network Clustering, PhD Thesis, Princeton University, Princeton, NJ, June 2002.
- G.W. Flake, K. Tsioutsiouliklis, R.E. Tarjan, Graph Clustering Techniques based on Minimum Cut Trees, Technical Report 2002-06, NEC, Princeton, NJ, 2002.
- E. Glover, K. Tsioutsiouliklis, S. Lawrence, D. Pennock, G.W. Flake, Using Web Structure for Classifying and Describing Web Pages, 11th International World Wide Web Conference, 2002.
- Presentation: G.W. Flake, K. Tsioutsiouliklis, S. Lawrence, Minimum Cut Clustering, The Learning Workshop, Snowbird, Utah, April 10-13 2001.
- H. Kaplan, R.E. Tarjan, K. Tsioutsiouliklis, Faster Kinetic Heaps and Their Use in Broadcast Scheduling, Proc. 12th ACM-SIAM Symposium on Discrete Algorithms, 2001.
- A.V. Goldberg and K. Tsioutsiouliklis, Cut tree algorithms: an experimental study, J. Algs. 38 (2001), no. 1, 51--83.
- A.V. Goldberg, K. Tsioutsiouliklis, Cut Tree Algorithms, Proc. 10th ACM-SIAM Symposium on Discrete Algorithms, 1999.
- A.V. Goldberg, K. Tsioutsiouliklis, Cut Tree Algorithms, Technical Report, NEC, Princeton, NJ, October 1998.
|
|
