default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 24 matches
- 2012
- Jianhui Chen, Ji Liu, Jieping Ye:
Learning Incoherent Sparse and Low-Rank Patterns from Multiple Tasks. ACM Trans. Knowl. Discov. Data 5(4): 22:1-22:31 (2012) - Charles Elkan, Yehuda Koren:
Guest Editorial for Special Issue KDD'10. ACM Trans. Knowl. Discov. Data 5(4): 18:1-18:2 (2012) - Manuel Gomez-Rodriguez, Jure Leskovec, Andreas Krause:
Inferring Networks of Diffusion and Influence. ACM Trans. Knowl. Discov. Data 5(4): 21:1-21:37 (2012) - Seungil Huh, Stephen E. Fienberg:
Discriminative Topic Modeling Based on Manifold Learning. ACM Trans. Knowl. Discov. Data 5(4): 20:1-20:25 (2012) - Tomoharu Iwata, Takeshi Yamada, Yasushi Sakurai, Naonori Ueda:
Sequential Modeling of Topic Dynamics with Multiple Timescales. ACM Trans. Knowl. Discov. Data 5(4): 19:1-19:27 (2012) - Dafna Shahaf, Carlos Guestrin:
Connecting Two (or Less) Dots: Discovering Structure in News Articles. ACM Trans. Knowl. Discov. Data 5(4): 24:1-24:31 (2012) - Hsiang-Fu Yu, Cho-Jui Hsieh, Kai-Wei Chang, Chih-Jen Lin:
Large Linear Classification When Data Cannot Fit in Memory. ACM Trans. Knowl. Discov. Data 5(4): 23:1-23:23 (2012) - 2011
- Hong Cheng, Yang Zhou, Jeffrey Xu Yu:
Clustering Large Attributed Graphs: A Balance between Structural and Attribute Similarities. ACM Trans. Knowl. Discov. Data 5(2): 12:1-12:33 (2011) - Daniel M. Dunlavy, Tamara G. Kolda, Evrim Acar:
Temporal Link Prediction Using Matrix and Tensor Factorizations. ACM Trans. Knowl. Discov. Data 5(2): 10:1-10:27 (2011) - U Kang, Charalampos E. Tsourakakis, Ana Paula Appel, Christos Faloutsos, Jure Leskovec:
HADI: Mining Radii of Large Graphs. ACM Trans. Knowl. Discov. Data 5(2): 8:1-8:24 (2011) - Yu-Ru Lin, Jimeng Sun, Hari Sundaram, Aisling Kelliher, Paul C. Castro, Ravi B. Konuru:
Community Discovery via Metagraph Factorization. ACM Trans. Knowl. Discov. Data 5(3): 17:1-17:44 (2011) - Panagis Magdalinos, Christos Doulkeridis, Michalis Vazirgiannis:
Enhancing Clustering Quality through Landmark-Based Dimensionality Reduction. ACM Trans. Knowl. Discov. Data 5(2): 11:1-11:44 (2011) - Marc E. Maier, Matthew J. Rattigan, David D. Jensen:
Indexing Network Structure with Shortest-Path Trees. ACM Trans. Knowl. Discov. Data 5(3): 15:1-15:25 (2011) - Aditya Krishna Menon, Charles Elkan:
Fast Algorithms for Approximating the Singular Value Decomposition. ACM Trans. Knowl. Discov. Data 5(2): 13:1-13:36 (2011) - Jimeng Sun, Yan Liu, Jie Tang, Chid Apté:
Introduction to Special Issue on Large-Scale Data Mining. ACM Trans. Knowl. Discov. Data 5(2): 7:1 (2011) - Timothy de Vries, Hui Ke, Sanjay Chawla, Peter Christen:
Robust Record Linkage Blocking Using Suffix Arrays and Bloom Filters. ACM Trans. Knowl. Discov. Data 5(2): 9:1-9:27 (2011) - Dingding Wang, Shenghuo Zhu, Tao Li, Yun Chi, Yihong Gong:
Integrating Document Clustering and Multidocument Summarization. ACM Trans. Knowl. Discov. Data 5(3): 14:1-14:26 (2011) - Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang, Philip S. Yu, Jian Pei:
Can the Utility of Anonymized Data be Used for Privacy Breaches? ACM Trans. Knowl. Discov. Data 5(3): 16:1-16:24 (2011) - 2010
- Mohamed Bouguessa, Shengrui Wang, Benoît Dumoulin:
Discovering Knowledge-Sharing Communities in Question-Answering Forums. ACM Trans. Knowl. Discov. Data 5(1): 3:1-3:49 (2010) - Kun Liu, Evimaria Terzi:
A Framework for Computing the Privacy Scores of Users in Online Social Networks. ACM Trans. Knowl. Discov. Data 5(1): 6:1-6:30 (2010) - Anon Plangprasopchok, Kristina Lerman:
Modeling Social Annotation: A Bayesian Approach. ACM Trans. Knowl. Discov. Data 5(1): 4:1-4:32 (2010) - Yasushi Sakurai, Christos Faloutsos, Spiros Papadimitriou:
Fast Discovery of Group Lag Correlations in Streams. ACM Trans. Knowl. Discov. Data 5(1): 5:1-5:43 (2010) - Jie Tang, Limin Yao, Duo Zhang, Jing Zhang:
A Combination Approach to Web User Profiling. ACM Trans. Knowl. Discov. Data 5(1): 2:1-2:44 (2010) - Ning Zhong, Gregory Piatetsky-Shapiro, Yiyu Yao, Philip S. Yu:
ACM TKDD Special Issue on Knowledge Discovery for Web Intelligence. ACM Trans. Knowl. Discov. Data 5(1): 1:1 (2010)
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-27 05:10 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint