Остановите войну!
for scientists:
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 149 matches
- 2011
- Charu C. Aggarwal, Yao Li, Philip S. Yu:
On the Hardness of Graph Anonymization. ICDM 2011: 1002-1007 - Rezwan Ahmed, George Karypis:
Algorithms for Mining the Evolution of Conserved Relational States in Dynamic Networks. ICDM 2011: 1-10 - Pranay Anchuri, Mohammed J. Zaki, Omer Barkol, Ruth Bergman, Yifat Felder, Shahar Golan, Arik Sityon:
Infrastructure Pattern Discovery in Configuration Management Databases via Large Sparse Graph Mining. ICDM 2011: 11-20 - Shin Ando, Einoshin Suzuki:
Role-Behavior Analysis from Trajectory Data by Cross-Domain Learning. ICDM 2011: 21-30 - Mohammad Taha Bahadori, Yan Liu, Dan Zhang:
Learning with Minimum Supervision: A General Framework for Transductive Transfer Learning. ICDM 2011: 61-70 - Hasna Barkia, Haytham Elghazel, Alex Aussem:
Semi-supervised Feature Importance Evaluation with Ensemble Learning. ICDM 2011: 31-40 - Justin D. Basilico, M. Arthur Munson, Tamara G. Kolda, Kevin R. Dixon, W. Philip Kegelmeyer:
COMET: A Recipe for Learning and Using Large Ensembles on Massive Data. ICDM 2011: 41-50 - Siddhartha Bhattacharyya:
Confidence in Predictions from Random Tree Ensembles. ICDM 2011: 71-80 - Petko Bogdanov, Misael Mongiovì, Ambuj K. Singh:
Mining Heavy Subgraphs in Time-Evolving Networks. ICDM 2011: 81-90 - Francesco Bonchi, Aristides Gionis, Antti Ukkonen:
Overlapping Correlation Clustering. ICDM 2011: 51-60 - Xiao Cai, Feiping Nie, Heng Huang, Chris H. Q. Ding:
Multi-Class L2, 1-Norm Support Vector Machine. ICDM 2011: 91-100 - Nan Cao, David Gotz, Jimeng Sun, Yu-Ru Lin, Huamin Qu:
SolarMap: Multifaceted Visual Analytics for Topic Exploration. ICDM 2011: 101-110 - Hong Cao, Xiaoli Li, David Yew-Kwong Woon, See-Kiong Ng:
SPO: Structure Preserving Oversampling for Imbalanced Time Series Classification. ICDM 2011: 1008-1013 - Miguel Á. Carreira-Perpiñán, Zhengdong Lu:
Manifold Learning and Missing Data Recovery through Unsupervised Regression. ICDM 2011: 1014-1019 - Mostafa Haghir Chehreghani:
Efficiently Mining Unordered Trees. ICDM 2011: 111-120 - Danqi Chen, Weizhu Chen, Qiang Yang:
Characterizing Inverse Time Dependency in Multi-class Learning. ICDM 2011: 1020-1025 - Yi-Cheng Chen, Wen-Chih Peng, Suh-Yin Lee:
CEMiner - An Efficient Algorithm for Mining Closed Patterns from Time Interval-Based Data. ICDM 2011: 121-130 - Prakash Mandayam Comar, Pang-Ning Tan, Anil K. Jain:
LinkBoost: A Novel Cost-Sensitive Boosting Framework for Community-Level Network Link Prediction. ICDM 2011: 131-140 - Pan Du, Jiafeng Guo, Xueqi Cheng:
Supervised Lazy Random Walk for Topic-Focused Multi-document Summarization. ICDM 2011: 1026-1031 - Avinava Dubey, Indrajit Bhattacharya, Mrinal Kanti Das, Tanveer A. Faruquie, Chiranjib Bhattacharyya:
Learning Dirichlet Processes from Partially Observed Groups. ICDM 2011: 141-150 - Wouter Duivesteijn, Arno J. Knobbe:
Exploiting False Discoveries - Statistical Validation of Patterns and Quality Measures in Subgroup Discovery. ICDM 2011: 151-160 - Wentao Fan, Nizar Bouguila, Djemel Ziou:
Unsupervised Anomaly Intrusion Detection via Localized Bayesian Feature Selection. ICDM 2011: 1032-1037 - Qiong Fang, Jianlin Feng, Wilfred Ng:
Identifying Differentially Expressed Genes via Weighted Rank Aggregation. ICDM 2011: 1038-1043 - Ahmed K. Farahat, Ali Ghodsi, Mohamed S. Kamel:
An Efficient Greedy Method for Unsupervised Feature Selection. ICDM 2011: 161-170 - Hongliang Fei, Jun Huan:
Structured Feature Selection and Task Relationship Inference for Multi-task Learning. ICDM 2011: 171-180 - Jing Gao, Wei Fan, Deepak S. Turaga, Srinivasan Parthasarathy, Jiawei Han:
A Spectral Framework for Detecting Inconsistency across Multi-source Object Relationships. ICDM 2011: 1050-1055 - Zekai Gao, Yangqiu Song, Shixia Liu, Haixun Wang, Hao Wei, Yang Chen, Weiwei Cui:
Tracking and Connecting Topics via Incremental Hierarchical Dirichlet Processes. ICDM 2011: 1056-1061 - Chuancong Gao, Jianyong Wang, Qingyan Yang:
Efficient Mining of Closed Sequential Patterns on Stream Sliding Window. ICDM 2011: 1044-1049 - Yong Ge, Hui Xiong, Chuanren Liu, Zhi-Hua Zhou:
A Taxi Driving Fraud Detection System. ICDM 2011: 181-190 - Marjan Ghazvininejad, Mostafa Mahdieh, Hamid R. Rabiee, Parisa Khanipour Roshan, Mohammad Hossein Rohban:
Isograph: Neighbourhood Graph Construction Based on Geodesic Distance for Semi-supervised Learning. ICDM 2011: 191-200
skipping 119 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-06-04 05:53 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