default search action
Yan Zhu 0014
Person information
- affiliation: University of California, Riverside, CA, USA
- affiliation (until 2013): Shanghai Jiao Tong University, School of Microelectronics, China
Other persons with the same name
- Yan Zhu — disambiguation page
- Yan Zhu 0001
— University of Macau, Analog and Mixed Signal VLSI Laboratory, Macao, China
- Yan Zhu 0002 — Stanford University, CA, USA
- Yan Zhu 0003 — Northwestern University, Evanston, IL, USA
- Yan Zhu 0004 — University of Sydney, Department of Electrical Engineering, Australia
- Yan Zhu 0005
- Yan Zhu 0006
- Yan Zhu 0007
- Yan Zhu 0008
- Yan Zhu 0009 — Facebook, Applied Machine Learning, USA (and 2 more)
- Yan Zhu 0010
- Yan Zhu 0011 — Tsinghua University, Department of Management Science & Engineering, Beijing, China
- Yan Zhu 0012 — Beijing Jiaotong University, China
- Yan Zhu 0013 — New Mexico University, Albuquerque, NM, USA
- Yan Zhu 0015 — Shanghai Jiao Tong University, School of Mathematical Sciences, China
- Yan Zhu 0016 — Chinese Academy of Sciences, State Key Laboratory of Computer Architecture, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j9]Yan Zhu
Matrix Profile IX: Admissible Time Series Motif Discovery With Missing Data. IEEE Trans. Knowl. Data Eng. 33(6): 2616-2626 (2021) - 2020
- [j8]Yan Zhu
The Swiss army knife of time series data mining: ten useful things you can do with the matrix profile and ten lines of code. Data Min. Knowl. Discov. 34(4): 949-979 (2020) - [j7]Michele Linardi
Matrix profile goes MAD: variable-length motif and discord discovery in data series. Data Min. Knowl. Discov. 34(4): 1022-1071 (2020) - [c11]Yan Zhu, Chin-Chia Michael Yeh, Zachary Zimmerman, Eamonn J. Keogh:
Matrix Profile XVII: Indexing the Matrix Profile to Allow Arbitrary Range Queries. ICDE 2020: 1846-1849 - [i5]Michele Linardi, Yan Zhu, Themis Palpanas, Eamonn J. Keogh:
VALMOD: A Suite for Easy and Exact Detection of Variable Length Motifs in Data Series. CoRR abs/2008.13432 (2020) - [i4]Michele Linardi, Yan Zhu, Themis Palpanas, Eamonn J. Keogh:
Matrix Profile Goes MAD: Variable-Length Motif And Discord Discovery in Data Series. CoRR abs/2008.13447 (2020)
2010 – 2019
- 2019
- [j6]Hoang Anh Dau, Anthony J. Bagnall, Kaveh Kamgar, Chin-Chia Michael Yeh, Yan Zhu, Shaghayegh Gharghabi, Chotirat Ann Ratanamahatana, Eamonn J. Keogh:
The UCR time series archive. IEEE CAA J. Autom. Sinica 6(6): 1293-1305 (2019) - [j5]Yan Zhu
Introducing time series chains: a new primitive for time series data mining. Knowl. Inf. Syst. 60(2): 1135-1161 (2019) - [j4]Diego Furtado Silva
Fast Similarity Matrix Profile for Music Analysis and Exploration. IEEE Trans. Multim. 21(1): 29-38 (2019) - [c10]Chin-Chia Michael Yeh, Yan Zhu, Hoang Anh Dau, Amirali Darvishzadeh, Mikhail Noskov
Online Amnestic DTW to allow Real-Time Golden Batch Monitoring. KDD 2019: 2604-2612 - 2018
- [b1]Yan Zhu:
The Matrix Profile: Scalable Algorithms and New Primitives for Time Series Data Mining. University of California, Riverside, USA, 2018 - [j3]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) - [j2]Yan Zhu
Exploiting a novel algorithm and GPUs to break the ten quadrillion pairwise comparisons barrier for time series motifs and joins. Knowl. Inf. Syst. 54(1): 203-236 (2018) - [c9]Yan Zhu, Chin-Chia Michael Yeh, Zachary Zimmerman, Kaveh Kamgar, Eamonn J. Keogh:
Matrix Profile XI: SCRIMP++: Time Series Motif Discovery at Interactive Speeds. ICDM 2018: 837-846 - [c8]Yan Zhu, Makoto Imamura, Daniel Nikovski, Eamonn J. Keogh:
Time Series Chains: A Novel Tool for Time Series Data Mining. IJCAI 2018: 5414-5418 - [c7]Michele Linardi
Matrix Profile X: VALMOD - Scalable Discovery of Variable-Length Motifs in Data Series. SIGMOD Conference 2018: 1053-1066 - [c6]Michele Linardi
VALMOD: A Suite for Easy and Exact Detection of Variable Length Motifs in Data Series. SIGMOD Conference 2018: 1757-1760 - [i3]Yan Zhu, Abdullah Mueen, Eamonn J. Keogh:
Admissible Time Series Motif Discovery with Missing Data. CoRR abs/1802.05472 (2018) - [i2]Hoang Anh Dau, Anthony J. Bagnall, Kaveh Kamgar, Chin-Chia Michael Yeh, Yan Zhu, Shaghayegh Gharghabi, Chotirat Ann Ratanamahatana, Eamonn J. Keogh:
The UCR Time Series Archive. CoRR abs/1810.07758 (2018) - [i1]Chin-Chia Michael Yeh, Yan Zhu, Evangelos E. Papalexakis, Abdullah Mueen, Eamonn J. Keogh:
Representation Learning by Reconstructing Neighborhoods. CoRR abs/1811.01557 (2018) - 2017
- [c5]Yan Zhu, Makoto Imamura, Daniel Nikovski, Eamonn J. Keogh:
Matrix Profile VII: Time Series Chains: A New Primitive for Time Series Data Mining (Best Student Paper Award). ICDM 2017: 695-704 - 2016
- [j1]Yan Zhu
Irrevocable-choice algorithms for sampling from a stream. Data Min. Knowl. Discov. 30(5): 998-1023 (2016) - [c4]Yan Zhu, Zachary Zimmerman, Nader Shakibay Senobari, Chin-Chia Michael Yeh, Gareth J. Funning
Matrix Profile II: Exploiting a Novel Algorithm and GPUs to Break the One Hundred Million Barrier for Time Series Motifs and Joins. ICDM 2016: 739-748 - [c3]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 - 2013
- [c2]Wenyao Sha, Yongxin Zhu, Tian Huang
A Multi-order Markov Chain Based Scheme for Anomaly Detection. COMPSAC Workshops 2013: 83-88 - [c1]Tian Huang
An LOF-Based Adaptive Anomaly Detection Scheme for Cloud Computing. COMPSAC Workshops 2013: 206-211
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-12-26 00:48 CET 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: