![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 83 matches
- 2010
- Zubin Abraham, Pang-Ning Tan
:
An Integrated Framework for Simultaneous Classification and Regression of Time-Series Data. SDM 2010: 653-664 - Evrim Acar, Daniel M. Dunlavy, Tamara G. Kolda
, Morten Mørup
:
Scalable Tensor Factorizations with Missing Data. SDM 2010: 701-712 - Charu C. Aggarwal:
On Multidimensional Sharpening of Uncertain Data. SDM 2010: 373-384 - Charu C. Aggarwal:
The Generalized Dimensionality Reduction Problem. SDM 2010: 607-618 - Charu C. Aggarwal, Philip S. Yu:
On Classification of High-Cardinality Data Streams. SDM 2010: 802-813 - Charu C. Aggarwal, Yuchen Zhao, Philip S. Yu:
On Clustering Graph Streams. SDM 2010: 478-489 - Faris Alqadah, Raj Bhatnagar, Anil G. Jegga
:
Mining Maximally Banded Matrices in Binary Data. SDM 2010: 942-953 - Mario Boley, Thomas Gärtner
, Henrik Grosskreutz:
Formal Concept Sampling for Counting and Threshold-Free Local Pattern Mining. SDM 2010: 177-188 - Yunpeng Cai, Yijun Sun, Yubo Cheng, Jian Li, Steve Goodison:
Fast Implementation of ℓ1Regularized Learning Algorithms Using Gradient Descent Methods. SDM 2010: 862-871 - Bilson J. L. Campana, Eamonn J. Keogh:
A Compression Based Distance Measure for Texture. SDM 2010: 850-861 - Nuno Filipe Castro, Paulo J. Azevedo
:
Multiresolution Motif Discovery in Time Series. SDM 2010: 665-676 - Pritam Chanda, Jianmei Yang, Aidong Zhang, Murali Ramanathan:
On Mining Statistically Significant Attribute Association Information. SDM 2010: 141-152 - Jaegul Choo, Chandan K. Reddy, Hanseung Lee
, Haesun Park:
p-ISOMAP: An Efficient Parametric Update for ISOMAP for Visual Analytics. SDM 2010: 502-513 - Xuan-Hong Dang, James Bailey:
Generation of Alternative Clusterings Using the CAMI Approach. SDM 2010: 118-129 - Ian Davidson, S. S. Ravi, Leonid Shamis:
A SAT-based Framework for Efficient Constrained Clustering. SDM 2010: 94-105 - Brian Delaney, Andrew S. Fast, William M. Campbell, Clifford J. Weinstein, David D. Jensen:
The Application of Statistical Relational Learning to a Database of Criminal and Terrorist Activity. SDM 2010: 409-417 - Pinar Donmez, Jaime G. Carbonell, Jeff G. Schneider:
A Probabilistic Framework to Learn from Multiple Annotators with Time-Varying Accuracy. SDM 2010: 826-837 - Wei Fan, Erheng Zhong, Jing Peng, Olivier Verscheure, Kun Zhang, Jiangtao Ren, Rong Yan, Qiang Yang:
Generalized and Heuristic-Free Feature Construction for Improved Accuracy. SDM 2010: 629-640 - Daan Fierens:
On the Use of Combining Rules in Relational Probability Trees. SDM 2010: 397-408 - Quanquan Gu, Jie Zhou, Chris H. Q. Ding:
Collaborative Filtering: Weighted Nonnegative Matrix Factorization Incorporating User and Item Graphs. SDM 2010: 199-210 - Stephan Günnemann, Hardy Kremer, Thomas Seidl
:
Subspace Clustering for Uncertain Data. SDM 2010: 385-396 - Greg Hamerly
:
Making k-means Even Faster. SDM 2010: 130-140 - Xiaoxu Han:
Nonnegative Principal Component Analysis for Proteomic Tumor Profiles. SDM 2010: 269-280 - Jingrui He, Jaime G. Carbonell:
Co-selection of Features and Instances for Unsupervised Rare Category Analysis. SDM 2010: 525-536 - Jiazhen He, Yang Zhang, Xue Li
, Yong Wang:
Naive Bayes Classifier for Positive Unlabeled Learning with Uncertainty. SDM 2010: 361-372 - Keith Henderson, Tina Eliassi-Rad, Spiros Papadimitriou, Christos Faloutsos
:
HCDF: A Hybrid Community Discovery Framework. SDM 2010: 754-765 - Syed Fawad Hussain
, Gilles Bisson:
Text Categorization Using Word Similarities Based on Higher Order Co-occurrences. SDM 2010: 1-12 - TaeHyun Hwang, Rui Kuang:
A Heterogeneous Label Propagation Algorithm for Disease Gene Discovery. SDM 2010: 583-594 - Akihiro Inokuchi, Takashi Washio:
Mining Frequent Graph Sequence Patterns Induced by Vertices. SDM 2010: 466-477 - Muhammad Asiful Islam, Faisal Ahmed, Yevgen Borodin, Jalal Mahmud, I. V. Ramakrishnan:
Improving Accessibility of Transaction-centric Web Objects. SDM 2010: 37-48
skipping 53 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-12 05:07 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