


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.
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 77 matches
- 2006
- Yi Fang, Hyun-Woo Cho, Myong Kee Jeong:
Health monitoring of a shaft transmission system via hybrid models of PCR and PLS. SDM 2006: 554-558 - Sreangsu Acharyya:
Transductive De-Noising and Dimensionality Reduction using Total Bregman Regression. SDM 2006: 514-518 - Charu C. Aggarwal:
Representation is Everything: Towards Efficient and Adaptable Similarity Measures for Biological Data. SDM 2006: 210-221 - Charu C. Aggarwal:
A Framework for Local Supervised Dimensionality Reduction of High Dimensional Data. SDM 2006: 360-371 - Charu C. Aggarwal, Philip S. Yu:
A Framework for Clustering Massive Text and Categorical Data Streams. SDM 2006: 479-483 - Eugene Agichtein:
Confidence Estimation Methods for Partially Supervised Information Extraction. SDM 2006: 539-543 - Muna Al-Razgan, Carlotta Domeniconi:
Weighted Clustering Ensembles. SDM 2006: 258-269 - Benjamin J. Anderson, Deborah S. Gross
, David R. Musicant, Anna M. Ritz, Thomas G. Smith
, Leah E. Steinberg:
Adapting K-Medians to Generate Normalized Cluster Centers. SDM 2006: 165-175 - Abraham Bagherjeiran, Chandrika Kamath:
Graph-based Methods for Orbit Classification. SDM 2006: 574-578 - Indrajit Bhattacharya, Lise Getoor:
A Latent Dirichlet Model for Unsupervised Entity Resolution. SDM 2006: 47-58 - Ella Bingham, Aristides Gionis, Niina Haiminen
, Heli Hiisilä, Heikki Mannila, Evimaria Terzi:
Segmentation and dimensionality reduction. SDM 2006: 372-383 - Anthony J. Bonner, Han Liu:
Towards the Prediction of Protein Abundance from Tandem Mass Spectrometry Data. SDM 2006: 599-603 - Facundo Bromberg
, Dimitris Margaritis, Vasant G. Honavar:
Efficient Markov Network Structure Discovery using Independence Tests. SDM 2006: 141-152 - Michael C. Burl, Dennis DeCoste, Brian L. Enke, Dominic Mazzoni, William J. Merline, Lucas Scharenbroich:
Automated Knowledge Discovery from Simulators. SDM 2006: 82-93 - Dongwei Cao, Daniel Boley:
On Approximate Solutions to Support Vector Machines. SDM 2006: 534-538 - Feng Cao, Martin Ester, Weining Qian, Aoying Zhou:
Density-Based Clustering over an Evolving Data Stream with Noise. SDM 2006: 328-339 - Zhijie Chen, Weizhen Chen, Qile Chen, Mian-Yun Chen:
Trend Relational Analysis and Grey-Fuzzy Clustering Method. SDM 2006: 234-245 - Keke Chen, Ling Liu:
Detecting the Change of Clustering Structure in Categorical Data Streams. SDM 2006: 504-508 - Xin Chen, Yi-Fang Wu:
Personalized Knowledge Discovery: Mining Novel Association Rules from Text. SDM 2006: 589-593 - Mehmet M. Dalkilic, Wyatt T. Clark, James C. Costello, Predrag Radivojac:
Using Compression to Identify Classes of Inauthentic Texts. SDM 2006: 604-608 - Souptik Datta, Chris Giannella, Hillol Kargupta:
K-Means Clustering Over a Large, Dynamic Network. SDM 2006: 153-164 - Christopher P. Diehl, Lise Getoor, Galileo Namata:
Name Reference Resolution in Organizational Email Archives. SDM 2006: 70-81 - Martin Ester, Rong Ge, Byron J. Gao, Zengjian Hu, Boaz Ben-Moshe:
Joint Cluster Analysis of Attribute Data and Relationship Data: the Connected k-Center Problem. SDM 2006: 246-257 - Yu Fujimoto, Noboru Murata:
Robust Estimation for Mixture of Probability Tables based on beta-likelihood. SDM 2006: 519-523 - Jing Gao, Haibin Cheng, Pang-Ning Tan
:
A Novel Framework for Incorporating Labeled Examples into Anomaly Detection. SDM 2006: 594-598 - Byron J. Gao, Martin Ester:
Cluster Description Formats, Problems and Algorithms. SDM 2006: 464-468 - Jing Gao, Pang-Ning Tan
, Haibin Cheng:
Semi-Supervised Clustering with Partial Background Information. SDM 2006: 489-493 - Amol Ghoting, Srinivasan Parthasarathy
, Matthew Eric Otey:
Fast Mining of Distance-Based Outliers in High Dimensional Datasets. SDM 2006: 609-613 - Fosca Giannotti, Mirco Nanni, Dino Pedreschi
:
Efficient Mining of Temporally Annotated Sequences. SDM 2006: 348-359 - Khaled M. Hammouda, Mohamed S. Kamel:
Collaborative Document Clustering. SDM 2006: 453-463
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.
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.
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.
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 2025-08-11 23:58 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