default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Knowledge Discovery from Data, Volume 8
Volume 8, Number 1, February 2014
- Wei Chen, Jie Tang:
Introduction to special issue on computational aspects of social and information networks: Theory, methodologies, and applications (TKDD-CASIN). 1:1-1:2 - Zhi Yang, Christo Wilson
, Xiao Wang, Tingting Gao, Ben Y. Zhao, Yafei Dai:
Uncovering social network Sybils in the wild. 2:1-2:29 - Ruoming Jin, Victor E. Lee, Longjie Li:
Scalable and axiomatic ranking of network role similarity. 3:1-3:37 - Julian J. McAuley, Jure Leskovec:
Discovering social circles in ego networks. 4:1-4:28 - Bruno D. Abrahao, Sucheta Soundarajan, John E. Hopcroft, Robert D. Kleinberg:
A separability framework for analyzing community structure. 5:1-5:29 - Erheng Zhong, Wei Fan, Qiang Yang:
User behavior learning and transfer in composite social networks. 6:1-6:32
Volume 8, Number 2, June 2013
- Nesreen K. Ahmed, Jennifer Neville, Ramana Rao Kompella:
Network Sampling: From Static to Streaming Graphs. 7:1-7:56 - Yong Ge, Guofei Jiang, Min Ding, Hui Xiong:
Ranking Metric Anomaly in Invariant Networks. 8:1-8:30 - Gensheng Zhang, Xiao Jiang, Ping Luo, Min Wang, Chengkai Li:
Discovering General Prominent Streaks in Sequence Data. 9:1-9:37 - Claudio Schifanella, K. Selçuk Candan, Maria Luisa Sapino:
Multiresolution Tensor Decompositions with Mode Hierarchies. 10:1-10:38
Volume 8, Number 3, June 2013
- Jin Huang, Feiping Nie, Heng Huang, Chris H. Q. Ding:
Robust Manifold Nonnegative Matrix Factorization. 11:1-11:21 - Yu Zhang, Dit-Yan Yeung:
A Regularization Approach to Learning Task Relationships in Multitask Learning. 12:1-12:31 - Ming Lin, Shifeng Weng, Changshui Zhang:
On the Sample Complexity of Random Fourier Features for Online Learning: How Many Random Fourier Features Do We Need? 13:1-13:19 - Ron Eyal, Avi Rosenfeld, Sigal Sina, Sarit Kraus:
Predicting and Identifying Missing Node Information in Social Networks. 14:1-14:35 - Geoffrey I. Webb, Jilles Vreeken:
Efficient Discovery of the Most Interesting Associations. 15:1-15:31 - Asaf Shabtai, Maya Bercovitch, Lior Rokach, Yuval Elovici:
Optimizing Data Misuse Detection. 16:1-16:23
Volume 8, Number 4, August 2014
- José Hernández-Orallo:
Probabilistic Reframing for Cost-Sensitive Regression. 17:1-17:55 - Pauli Miettinen, Jilles Vreeken:
MDL4BMF: Minimum Description Length for Boolean Matrix Factorization. 18:1-18:31 - Jiliang Tang, Huan Liu:
Feature Selection for Social Media Data. 19:1-19:27 - Matteo Riondato, Eli Upfal:
Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees. 20:1-20:32 - Scott H. Burton, Christophe G. Giraud-Carrier:
Discovering Social Circles in Directed Graphs. 21:1-21:27 - Saurabh Paul, Christos Boutsidis, Malik Magdon-Ismail, Petros Drineas:
Random Projections for Linear Support Vector Machines. 22:1-22:25 - Dóra Erdös, Rainer Gemulla, Evimaria Terzi:
Reconstructing Graphs from Neighborhood Data. 23:1-23:22
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
