default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMagdalena Jankowska
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i2]Magdalena Jankowska, Lukasz Matysiak:
A polynomial composites and monoid domains as algebraic structures and their applications. CoRR abs/2105.15145 (2021)- 2020
- [c8]Md. Rashadul Hasan Rakib, Norbert Zeh, Magdalena Jankowska, Evangelos E. Milios:
Enhancement of Short Text Clustering by Iterative Classification. NLDB 2020: 105-117 - [i1]Md. Rashadul Hasan Rakib, Norbert Zeh, Magdalena Jankowska, Evangelos E. Milios:
Enhancement of Short Text Clustering by Iterative Classification. CoRR abs/2001.11631 (2020)
2010 – 2019
- 2018
- [c7]Magdalena Jankowska, Colin Conrad
, Jabez Harris, Vlado Keselj:
N-Gram Based Approach for Automatic Prediction of Essay Rubric Marks. Canadian AI 2018: 298-303 - [c6]Md. Rashadul Hasan Rakib, Magdalena Jankowska, Norbert Zeh, Evangelos E. Milios:
Improving Short Text Clustering by Similarity Matrix Sparsification. DocEng 2018: 50:1-50:4 - 2014
- [c5]Magdalena Jankowska, Vlado Keselj, Evangelos E. Milios:
Ensembles of Proximity-Based One-Class Classifiers for Author Verification Notebook for PAN at CLEF 2014. CLEF (Working Notes) 2014: 1069-1072 - [c4]Magdalena Jankowska, Evangelos E. Milios, Vlado Keselj:
Author Verification Using Common N-Gram Profiles of Text Documents. COLING 2014: 387-397 - 2013
- [c3]Magdalena Jankowska, Vlado Keselj, Evangelos E. Milios:
Proximity Based One-class Classification with Common N-Gram Dissimilarity for Authorship Verification Task Notebook for PAN at CLEF 2013. CLEF (Working Notes) 2013 - [c2]Magdalena Jankowska, Vlado Keselj, Evangelos E. Milios:
CNG Text Classification for Authorship Profiling Task Notebook for PAN at CLEF 2013. CLEF (Working Notes) 2013 - 2012
- [c1]Magdalena Jankowska, Vlado Keselj, Evangelos E. Milios:
Relative N-gram signatures: Document visualization at the level of character N-grams. IEEE VAST 2012: 103-112
2000 – 2009
- 2006
- [j1]Russell Greiner, Ryan Hayward, Magdalena Jankowska, Michael Molloy:
Finding optimal satisficing strategies for and-or trees. Artif. Intell. 170(1): 19-58 (2006)
Coauthor Index
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.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
