![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 20 matches
- 2009
- Massimiliano Caramia
, Stefano Giordani
:
On the selection of k efficient paths by clustering techniques. Int. J. Data Min. Model. Manag. 1(3): 237-260 (2009) - Jan Fabian Ehmke
, Stephan Meisel, Stefan Engelmann, Dirk Christian Mattfeld
:
Data chain management for planning in city logistics. Int. J. Data Min. Model. Manag. 1(4): 335-356 (2009) - Vikas K. Garg, M. Narasimha Murty:
Feature subspace SVMs (FS-SVMs) for high dimensional handwritten digit recognition. Int. J. Data Min. Model. Manag. 1(4): 411-436 (2009) - Dang Thi Thu Hien, Hoang Xuan Huan, Huu Tue Huynh:
Multivariate interpolation using radial basis function networks. Int. J. Data Min. Model. Manag. 1(3): 291-309 (2009) - Liping Jing, Mark Junjie Li, Michael K. Ng
, Yiu-ming Cheung
, Joshua Zhexue Huang:
SMART: a subspace clustering algorithm that automatically identifies the appropriate number of clusters. Int. J. Data Min. Model. Manag. 1(2): 149-177 (2009) - Douglas M. Kline, Craig S. Galbraith:
Performance analysis of the Bayesian data reduction algorithm. Int. J. Data Min. Model. Manag. 1(3): 223-236 (2009) - Sotiris B. Kotsiantis
:
Locally application of random subspace with simple Bayesian classifier. Int. J. Data Min. Model. Manag. 1(4): 375-392 (2009) - Sunil Kumar, Shamik Sural
, Alok Watve, Sakti Pramanik:
CNODE: clustering of set-valued non-ordered discrete data. Int. J. Data Min. Model. Manag. 1(3): 310-334 (2009) - Marc Plantevit
, Thierry Charnois
, Jirí Kléma
, Christophe Rigotti, Bruno Crémilleux:
Combining sequence and itemset mining to discover named entities in biomedical texts: a new type of pattern. Int. J. Data Min. Model. Manag. 1(2): 119-148 (2009) - Tushar Kumar Pratihar, Dilip Kumar Pratihar:
Design of cluster-wise optimal fuzzy logic controllers to model input-output relationships of some manufacturing processes. Int. J. Data Min. Model. Manag. 1(2): 178-205 (2009) - Vassilios S. Verykios
, Alexandros Karakasidis, Vassilios K. Mitrogiannis:
Privacy preserving record linkage approaches. Int. J. Data Min. Model. Manag. 1(2): 206-221 (2009) - Renxia Wan, Jingchao Chen, Lixin Wang, Xiaoke Su:
Grid-based clustering over an evolving data stream. Int. J. Data Min. Model. Manag. 1(4): 393-410 (2009) - Xiong Wang:
ER modelling - a zoom in and zoom out approach. Int. J. Data Min. Model. Manag. 1(4): 357-374 (2009) - Panagiotis Xidonas, Emmanouil Ergazakis, Konstantinos Ergazakis, Kostas S. Metaxiotis, John E. Psarras:
Evaluating corporate performance within the frame of the expert systems technology. Int. J. Data Min. Model. Manag. 1(3): 261-290 (2009) - 2008
- Kyriacos Chrysostomou, Sherry Y. Chen, Xiaohui Liu:
Combining multiple classifiers for wrapper feature selection. Int. J. Data Min. Model. Manag. 1(1): 91-102 (2008) - Jens C. Huhn, Eyke Hüllermeier:
Is an ordinal class structure useful in classifier learning? Int. J. Data Min. Model. Manag. 1(1): 45-67 (2008) - Donato Malerba
:
A relational perspective on spatial data mining. Int. J. Data Min. Model. Manag. 1(1): 103-118 (2008) - Gilbert Ritschard
, Alexis Gabadinho, Nicolas S. Müller, Matthias Studer
:
Mining event histories: a social science perspective. Int. J. Data Min. Model. Manag. 1(1): 68-90 (2008) - Shankara B. Subramanya, Zheshen Wang, Baoxin Li, Huan Liu:
Completing missing views for multiple sources of web media. Int. J. Data Min. Model. Manag. 1(1): 23-44 (2008) - Clay Woolam, Latifur Khan
:
Multi-label large margin hierarchical perceptron. Int. J. Data Min. Model. Manag. 1(1): 5-22 (2008)
loading more results
failed to load more results, please try again later
![](https://dblp.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-01 23:59 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