default search action
Nurjahan Begum
Person information
- affiliation: University of California, Riverside, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j2]Chin-Chia Michael Yeh, Yan Zhu, Liudmila Ulanova, Nurjahan Begum, Yifei Ding, Hoang Anh Dau, Zachary Zimmerman, Diego Furtado Silva, Abdullah Mueen, Eamonn J. Keogh:
Time series joins, motifs, discords and shapelets: a unifying view that exploits the matrix profile. Data Min. Knowl. Discov. 32(1): 83-123 (2018) - 2016
- [b1]Nurjahan Begum:
Exploiting Time Series Primitives to Solve Realistic Data Mining Problems. University of California, Riverside, USA, 2016 - [c7]Hoang Anh Dau, Nurjahan Begum, Eamonn J. Keogh:
Semi-Supervision Dramatically Improves Time Series Clustering under Dynamic Time Warping. CIKM 2016: 999-1008 - [c6]Chin-Chia Michael Yeh, Yan Zhu, Liudmila Ulanova, Nurjahan Begum, Yifei Ding, Hoang Anh Dau, Diego Furtado Silva, Abdullah Mueen, Eamonn J. Keogh:
Matrix Profile I: All Pairs Similarity Joins for Time Series: A Unifying View That Includes Motifs, Discords and Shapelets. ICDM 2016: 1317-1322 - [c5]Liudmila Ulanova, Nurjahan Begum, Mohammad Shokoohi-Yekta, Eamonn J. Keogh:
Clustering in the Face of Fast Changing Streams. SDM 2016: 1-9 - [i1]Nurjahan Begum, Liudmila Ulanova, Hoang Anh Dau, Jun Wang, Eamonn J. Keogh:
A General Framework for Density Based Time Series Clustering Exploiting a Novel Admissible Pruning Strategy. CoRR abs/1612.00637 (2016) - 2015
- [c4]Nurjahan Begum, Liudmila Ulanova, Jun Wang, Eamonn J. Keogh:
Accelerating Dynamic Time Warping Clustering with a Novel Admissible Pruning Strategy. KDD 2015: 49-58 - [c3]Liudmila Ulanova, Nurjahan Begum, Eamonn J. Keogh:
Scalable Clustering of Time Series with U-Shapelets. SDM 2015: 900-908 - 2014
- [j1]Nurjahan Begum, Eamonn J. Keogh:
Rare Time Series Motif Discovery from Unbounded Streams. Proc. VLDB Endow. 8(2): 149-160 (2014) - 2013
- [c2]Nurjahan Begum, Bing Hu, Thanawin Rakthanmanon, Eamonn J. Keogh:
A Minimum Description Length Technique for Semi-Supervised Time Series Classification. IRI (best papers) 2013: 171-192 - [c1]Nurjahan Begum, Bing Hu, Thanawin Rakthanmanon, Eamonn J. Keogh:
Towards a minimum description length based stopping criterion for semi-supervised time series classification. IRI 2013: 333-340
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-09-09 01:12 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: