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 105 matches
- 2005
- Charu C. Aggarwal:
Towards exploratory test instance specific algorithms for high dimensional classification. KDD 2005: 526-531 - Arindam Banerjee, Chase Krumpelman, Joydeep Ghosh, Sugato Basu, Raymond J. Mooney:
Model-based overlapping clustering. KDD 2005: 532-537 - Albert-László Barabási:
The architecture of complexity: the structure and the dynamics of networks, from the web to the cell. KDD 2005: 3 - Christopher Besemann, Anne Denton:
Integration of profile hidden Markov model output into association rule mining. KDD 2005: 538-543 - Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou:
Scalable discovery of hidden emails from large folders. KDD 2005: 544-549 - Chien Chin Chen, Meng Chang Chen, Ming-Syan Chen:
LIPED: HMM-based life profiles for adaptive event detection. KDD 2005: 556-561 - Rong Chen, Edward Herskovits:
A Bayesian network classifier with inverse tree structure for voxelwise magnetic resonance image analysis. KDD 2005: 4-12 - Haifeng Chen, Guofei Jiang, Cristian Ungureanu, Kenji Yoshihira:
Failure detection and localization in component based systems by online tracking. KDD 2005: 750-755 - Xin Chen, Yi-fang Brook Wu:
Web mining from competitors' websites. KDD 2005: 550-555 - Richard Cole, Dennis E. Shasha, Xiaojian Zhao:
Fast window correlations over uncooperative time series. KDD 2005: 743-749 - Shengnan Cong, Jiawei Han, David A. Padua:
Parallel mining of closed sequential patterns. KDD 2005: 562-567 - Anirban Dasgupta, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins:
Variable latent semantic indexing. KDD 2005: 13-21 - Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis:
A fast kernel-based multilevel algorithm for graph clustering. KDD 2005: 629-634 - Jianping Fan, Hangzai Luo, Mohand-Said Hacid:
Mining images on semantics via statistical learning. KDD 2005: 22-31 - Andrew S. Fast, David D. Jensen, Brian Neil Levine:
Creating social networks to improve peer-to-peer networking. KDD 2005: 568-573 - George Forman, Kave Eshghi, Stephane Chiocchetti:
Finding similar files in large document repositories. KDD 2005: 394-400 - Ryohei Fujimaki, Takehisa Yairi, Kazuo Machida:
An approach to spacecraft anomaly detection problem using kernel feature space. KDD 2005: 401-410 - Gian Fulgoni:
Mining the internet: the eighth wonder of the world. KDD 2005: 2 - Glenn Fung, Sathyakama Sandilya, R. Bharat Rao:
Rule extraction from linear support vector machines. KDD 2005: 32-40 - Bin Gao, Tie-Yan Liu, Xin Zheng, QianSheng Cheng, Wei-Ying Ma:
Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering. KDD 2005: 41-50 - Rayid Ghani:
Price prediction and insurance for online auctions. KDD 2005: 411-418 - Aristides Gionis, Alexander Hinneburg, Spiros Papadimitriou, Panayiotis Tsaparas:
Dimension induced clustering. KDD 2005: 51-60 - Natalie S. Glance, Matthew Hurst, Kamal Nigam, Matthew Siegler, Robert Stockton, Takashi Tomokiyo:
Deriving marketing intelligence from online discussion. KDD 2005: 419-428 - Bart Goethals, Eveline Hoekx, Jan Van den Bussche:
Mining tree queries in a graph. KDD 2005: 61-69 - David Gondek, Thomas Hofmann:
Non-redundant clustering with conditional ensembles. KDD 2005: 70-77 - Daniel Gruhl, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, Andrew Tomkins:
The predictive power of online chatter. KDD 2005: 78-87 - Sudipto Guha, Boulos Harb:
Wavelet synopsis for data streams: minimizing non-euclidean error. KDD 2005: 88-97 - Ramanathan V. Guha, Ravi Kumar, D. Sivakumar, Ravi Sundaram:
Unweaving a web of documents. KDD 2005: 574-579 - Bin He, Kevin Chen-Chuan Chang:
Making holistic schema matching robust: an ensemble approach. KDD 2005: 429-438 - Cinda Heeren, Leonard Pitt:
Maximal boasting. KDD 2005: 580-585
skipping 75 more matches
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-25 20:52 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