default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTiantian Xu 0002
Person information
- affiliation: Qilu University of Technology, School of Information, Jinan, China
- affiliation: Shandong Academy of Sciences, China
- affiliation (PhD 2018): Ocean University, Department of Software Engineering, China
Other persons with the same name
- Tiantian Xu — disambiguation page
- Tiantian Xu 0001
![[0000-0001-8974-4572]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-8974-4572")
— Chinese Academy of Sciences, Guangdong Provincial Key Laboratory of Robotics and Intelligent System, Shenzhen, China (and 2 more) - Tiantian Xu 0003 — Dalian University of Technology, School of Software, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j17]Tiantian Xu, Yuanyuan Xu, Shiyu Yang, Binghao Li, Wenjie Zhang:
Learning Accurate Label-Specific Features From Partially Multilabeled Data. IEEE Trans. Neural Networks Learn. Syst. 35(8): 10436-10450 (2024)- 2023
- [j16]Xinming Gao, Yongshun Gong, Tiantian Xu, Jinhu Lü, Yuhai Zhao, Xiangjun Dong:
Toward Better Structure and Constraint to Mine Negative Sequential Patterns. IEEE Trans. Neural Networks Learn. Syst. 34(2): 571-585 (2023) - 2022
- [j15]Yanyu Hu, Long Zhao, Zhao Li, Xiangjun Dong, Tiantian Xu, Yuhai Zhao:
Classifying the multi-omics data of gastric cancer using a deep feature selection method. Expert Syst. Appl. 200: 116813 (2022) - [j14]Boxin Guan, Tiantian Xu, Yuhai Zhao, Yuan Li, Xiangjun Dong:
A random grouping-based self-regulating artificial bee colony algorithm for interactive feature detection. Knowl. Based Syst. 243: 108434 (2022) - 2020
- [j13]Tiantian Xu, Long Zhao:
A Structure-Induced Framework for Multi-Label Feature Selection With Highly Incomplete Labels. IEEE Access 8: 71219-71230 (2020) - [j12]Xiangjun Dong, Feng Hao, Long Zhao, Tiantian Xu:
An efficient method for pruning redundant negative and positive association rules. Neurocomputing 393: 245-258 (2020) - [j11]Mengjiao Zhang, Tiantian Xu, Zhao Li, Xiqing Han, Xiangjun Dong:
e-HUNSR: An Efficient Algorithm for Mining High Utility Negative Sequential Rules. Symmetry 12(8): 1211 (2020) - 2019
- [j10]Xiaoqi Jiang, Tiantian Xu, Xiangjun Dong:
Campus Data Analysis Based on Positive and Negative Sequential Patterns. Int. J. Pattern Recognit. Artif. Intell. 33(5): 1959016:1-1959016:16 (2019) - [j9]Xiangjun Dong, Ping Qiu, Jinhu Lü, Longbing Cao, Tiantian Xu:
Mining Top- ${k}$ Useful Negative Sequential Patterns via Learning. IEEE Trans. Neural Networks Learn. Syst. 30(9): 2764-2778 (2019) - 2018
- [j8]Tiantian Xu, Tongxuan Li, Xiangjun Dong:
Efficient High Utility Negative Sequential Patterns Mining in Smart Campus. IEEE Access 6: 23839-23847 (2018) - [j7]Ying Yin, Xiangjun Dong, Tiantian Xu:
Rapid and Efficient Bug Assignment Using ELM for IOT Software. IEEE Access 6: 52713-52724 (2018) - [j6]Tiantian Xu, Xiangjun Dong, Jianliang Xu, Xue Dong:
Erratum: "Mining High Utility Sequential Patterns with Negative Item Values". Int. J. Pattern Recognit. Artif. Intell. 32(6): 1892001:1-1892001:1 (2018) - [j5]Tiantian Xu, Jianliang Xu, Xiangjun Dong:
Mining High Utility Sequential Patterns Using Multiple Minimum Utility. Int. J. Pattern Recognit. Artif. Intell. 32(10): 1859017:1-1859017:18 (2018) - 2017
- [j4]Yongshun Gong, Tiantian Xu, Xiangjun Dong, Guohua Lv:
e-NSPFI: Efficient Mining Negative Sequential Pattern from Both Frequent and Infrequent Positive Sequential Patterns. Int. J. Pattern Recognit. Artif. Intell. 31(2): 1750002:1-1750002:20 (2017) - [j3]Tiantian Xu, Xiangjun Dong, Jianliang Xu, Yongshun Gong:
E-msNSP: Efficient Negative Sequential Patterns Mining Based on Multiple Minimum Supports. Int. J. Pattern Recognit. Artif. Intell. 31(2): 1750003:1-1750003:17 (2017) - [j2]Tiantian Xu, Xiangjun Dong, Jianliang Xu, Xue Dong:
Mining High Utility Sequential Patterns with Negative Item Values. Int. J. Pattern Recognit. Artif. Intell. 31(10): 1750035:1-1750035:17 (2017) - 2015
- [j1]Xiangjun Dong, Chuanlu Liu, Tiantian Xu, Dakui Wang:
Select actionable positive or negative sequential patterns. J. Intell. Fuzzy Syst. 29(6): 2759-2767 (2015)
Conference and Workshop Papers
- 2022
- [c5]Chuanhou Sun, Xiaoqi Jiang, Xiangjun Dong, Tiantian Xu, Long Zhao, Zhao Li, Yuhai Zhao:
Mining Negative Sequential Rules from Negative Sequential Patterns. DASFAA (1) 2022: 459-475 - 2019
- [c4]Tiantian Xu:
An Efficient Algorithm to Mine High Average-Utility Sequential Patterns. ICNC-FSKD 2019: 14-22 - 2018
- [c3]Feng Hao, Long Zhao, Tiantian Xu, Xiangjun Dong:
Application of Negative and Positive Association Rules in Mental Health Analysis of College Students. ICNC-FSKD 2018: 717-723 - 2017
- [c2]Tongxuan Li, Tiantian Xu, Xiangjun Dong:
HUNSPM: An efficient algorithm for mining high utility negative sequential patterns. ICNC-FSKD 2017: 1833-1837 - 2013
- [c1]Tiantian Xu, Xiangjun Dong:
Mining frequent patterns with multiple minimum supports using basic Apriori. ICNC 2013: 957-961
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-10-07 22:05 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:
