![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/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 22 matches
- 2016
- Niraj Kumar, Kannan Srinathan, Vasudeva Varma
:
A graph-based unsupervised N-gram filtration technique for automatic keyphrase extraction. Int. J. Data Min. Model. Manag. 8(2): 124-143 (2016) - Bilel Ben Ali, Youssef Masmoudi
, Souhail Dhouib
:
Upper bounds for time and accuracy improvement of dynamic time warping approximation. Int. J. Data Min. Model. Manag. 8(2): 107-123 (2016) - Duong Tuan Anh, Nguyen Van Nhat:
An efficient implementation of EMD algorithm for motif discovery in time series data. Int. J. Data Min. Model. Manag. 8(2): 180-194 (2016) - Samiha Brahimi, Mohamed-Khireddine Kholladi:
A genetic approach for materialised skyline views selection problem. Int. J. Data Min. Model. Manag. 8(3): 223-243 (2016) - Deepak Deshpande:
An efficient method for discovery of large item sets. Int. J. Data Min. Model. Manag. 8(4): 303-314 (2016) - Rehab M. Duwairi, Islam Qarqaz:
A framework for Arabic sentiment analysis using supervised classification. Int. J. Data Min. Model. Manag. 8(4): 369-381 (2016) - Georgia Garani
, George K. Adam
, Dimitrios Ventzas:
Temporal data warehouse logical modelling. Int. J. Data Min. Model. Manag. 8(2): 144-159 (2016) - Rajni Jindal, Dutta Borah Malaya:
A novel approach for mining frequent patterns from incremental data. Int. J. Data Min. Model. Manag. 8(3): 244-264 (2016) - P. Kalaivani, K. L. Shunmuganathan:
Feature selection based on genetic algorithm and hybrid model for sentiment polarity classification. Int. J. Data Min. Model. Manag. 8(4): 315-329 (2016) - Harihar Kalia, Satchidananda Dehuri
, Ashish Ghosh
, Sung-Bae Cho:
On the mining of fuzzy association rule using multi-objective genetic algorithms. Int. J. Data Min. Model. Manag. 8(1): 1-31 (2016) - Vandana Korde:
Information extraction for personalised services based on conference alerts. Int. J. Data Min. Model. Manag. 8(1): 93-105 (2016) - Farek Lazhar, Yamina Tlili Guiyassa:
Mining explicit and implicit opinions from reviews. Int. J. Data Min. Model. Manag. 8(1): 75-92 (2016) - Athraa Jasim Mohammed, Yuhanis Yusof, Husniza Binti Husni:
Discovering optimal clusters using firefly algorithm. Int. J. Data Min. Model. Manag. 8(4): 330-347 (2016) - S. Prasanna, Devarasan Ezhilmaran
:
Association rule mining using enhanced apriori with modified GA for stock prediction. Int. J. Data Min. Model. Manag. 8(2): 195-207 (2016) - Rajendra Kumar Roul, Shubham Rohan Asthana, Gaurav Kumar:
Spam web page detection using combined content and link features. Int. J. Data Min. Model. Manag. 8(3): 209-222 (2016) - K. V. Shanthi, J. Akilandeswari, G. Jothi:
Mining frequent patterns without tree generation. Int. J. Data Min. Model. Manag. 8(3): 265-278 (2016) - J. I. Sheeba, K. Vivekanandan:
Extracting keywords from budget transcripts using fuzzy logic. Int. J. Data Min. Model. Manag. 8(1): 62-74 (2016) - M. Jeya Sutha, F. Ramesh Dhanaseelan:
An effective hashtable-based approach for incrementally mining closed frequent itemsets using sliding windows. Int. J. Data Min. Model. Manag. 8(4): 382-404 (2016) - Muthuraman Thangaraj, C. R. Vijayalakshmi:
An efficient multi relational framework using fuzzy rule-based classification technique. Int. J. Data Min. Model. Manag. 8(4): 348-368 (2016) - Kanchan Shailendra Tiwari, Ashwin G. Kothari
:
Design of intelligent system for medical applications using rough set theory. Int. J. Data Min. Model. Manag. 8(3): 279-301 (2016) - S. M. Uma, E. Kirubakaran:
A hybrid heuristic dimensionality reduction technique for microarray gene expression data classification: a blending of GA, PSO and ACO. Int. J. Data Min. Model. Manag. 8(2): 160-179 (2016) - Hédia Zardi, Lotfi Ben Romdhane, Zahia Guessoum:
Efficiently mining community structures in weighted social networks. Int. J. Data Min. Model. Manag. 8(1): 32-61 (2016)
loading more results
failed to load more results, please try again later
![](https://dblp.org/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-09 10:42 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