default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLoan T. T. Nguyen
Nguyen Thi Thuy Loan
Person information
- affiliation (since 2018): Ho Chi Minh City International University, School of Computer Science and Engineering, Vietnam
- affiliation (2018): Ton Duc Thang University, Division of Knowledge and System Engineering for ICT, Ho Chi Minh City, Vietnam
- affiliation (2016-2017): Nguyen Tat Thanh University, Faculty of Information Technology, Ho Chi Minh City, Vietnam
- affiliation (2007-2016): VOV College, Ho Chi Minh City, Vietnam
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2025
[j53]Trang T. D. Nguyen, Loan T. T. Nguyen
, Quang-Thinh Bui, Le Nhat Duy, Bay Vo:
NS-IDBSCAN: An efficient incremental clustering method for geospatial data in network space. Inf. Sci. 690: 121526 (2025)- 2024
- [j52]Bao Huynh, N. T. Tung, Trinh D. D. Nguyen, Cuong Trinh, Václav Snásel, Loan T. T. Nguyen:
New approaches for mining high utility itemsets with multiple utility thresholds. Appl. Intell. 54(11-12): 767-790 (2024) - [j51]Bao Huynh, Lam B. Q. Nguyen, Duc H. M. Nguyen, Ngoc Thanh Nguyen, Hung Son Nguyen, Tuyn Pham, Tri Pham, Loan T. T. Nguyen, Trinh D. D. Nguyen, Bay Vo:
Mining Association Rules from a Single Large Graph. Cybern. Syst. 55(3): 693-707 (2024) - [j50]N. T. Tung, Trinh D. D. Nguyen, Loan T. T. Nguyen, Bay Vo:
An efficient method for mining High-Utility itemsets from unstable negative profit databases. Expert Syst. Appl. 237(Part C): 121489 (2024) - [j49]Anh Nguyen, Ngoc Thanh Nguyen, Loan T. T. Nguyen, Bay Vo:
An efficient pruning method for mining inter-sequence patterns based on pseudo-IDList. Expert Syst. Appl. 238(Part B): 121738 (2024) - [j48]Trinh D. D. Nguyen, N. T. Tung, Loan T. T. Nguyen, Thiet T. Pham, Bay Vo:
MLC-miner: Efficiently discovering multi-level closed high utility patterns from quantitative hierarchical transaction databases. Expert Syst. Appl. 254: 124383 (2024) - [j47]Huy Minh Huynh, Nam Ngoc Pham, Zuzana Komínková Oplatková, Loan T. T. Nguyen, Ngoc Thanh Nguyen, Unil Yun, Bay Vo:
Incremental clickstream pattern mining with search boundaries. Inf. Sci. 662: 120257 (2024) - [j46]Bao Huynh, N. T. Tung, Trinh D. D. Nguyen, Quang-Thinh Bui, Loan T. T. Nguyen, Unil Yun, Bay Vo:
An efficient strategy for mining high-efficiency itemsets in quantitative databases. Knowl. Based Syst. 299: 112035 (2024) - 2023
- [j45]Phu Pham, Loan T. T. Nguyen, Witold Pedrycz, Bay Vo:
Deep learning, graph-based text representation and classification: a survey, perspectives and challenges. Artif. Intell. Rev. 56(6): 4893-4927 (2023) - [j44]Anh Nguyen, Ngoc-Thanh Nguyen, Loan T. T. Nguyen, Bay Vo:
Mining inter-sequence patterns with Itemset constraints. Appl. Intell. 53(17): 19827-19842 (2023) - [j43]Trang T. D. Nguyen, Loan T. T. Nguyen, Quang-Thinh Bui, Unil Yun, Bay Vo:
An efficient topological-based clustering method on spatial data in network space. Expert Syst. Appl. 215: 119395 (2023) - [j42]Phu Pham, Loan T. T. Nguyen, Ngoc Thanh Nguyen, Robert Kozma, Bay Vo:
A hierarchical fused fuzzy deep neural network with heterogeneous network embedding for recommendation. Inf. Sci. 620: 105-124 (2023) - [j41]Loan T. T. Nguyen, Thang Mai, Giao-Huy Pham, Unil Yun, Bay Vo:
An efficient method for mining high occupancy itemsets based on equivalence class and early pruning. Knowl. Based Syst. 267: 110441 (2023) - [j40]Trinh D. D. Nguyen, N. T. Tung, Thiet Pham, Loan T. T. Nguyen:
Parallel approaches to extract multi-level high utility itemsets from hierarchical transaction databases. Knowl. Based Syst. 276: 110733 (2023) - [j39]Phu Pham, Loan T. T. Nguyen, Ngoc Thanh Nguyen, Witold Pedrycz, Unil Yun, Jerry Chun-Wei Lin, Bay Vo:
An Approach to Semantic-Aware Heterogeneous Network Embedding for Recommender Systems. IEEE Trans. Cybern. 53(9): 6027-6040 (2023) - 2022
- [j38]N. T. Tung, Loan T. T. Nguyen, Trinh D. D. Nguyen, Bay Vo:
An efficient method for mining multi-level high utility Itemsets. Appl. Intell. 52(5): 5475-5496 (2022) - [j37]Lam B. Q. Nguyen, Loan T. T. Nguyen, Bay Vo, Ivan Zelinka, Jerry Chun-Wei Lin, Unil Yun, Hung Son Nguyen:
An efficient and scalable approach for mining subgraphs in a single large graph. Appl. Intell. 52(15): 17881-17895 (2022) - [j36]Phu Pham, Loan T. T. Nguyen, Bay Vo, Unil Yun:
Bot2Vec: A general approach of intra-community oriented representation learning for bot detection in different types of social networks. Inf. Syst. 103: 101771 (2022) - [j35]Huy Minh Huynh, Loan T. T. Nguyen, Bay Vo, Zuzana Komínková Oplatková, Philippe Fournier-Viger, Unil Yun:
An efficient parallel algorithm for mining weighted clickstream patterns. Inf. Sci. 582: 349-368 (2022) - [j34]N. T. Tung, Loan T. T. Nguyen, Trinh D. D. Nguyen, Philippe Fournier-Viger, Ngoc Thanh Nguyen, Bay Vo:
Efficient mining of cross-level high-utility itemsets in taxonomy quantitative databases. Inf. Sci. 587: 41-62 (2022) - [j33]Huy Minh Huynh, Loan T. T. Nguyen, Nam Ngoc Pham, Zuzana Komínková Oplatková, Unil Yun, Bay Vo:
An efficient method for mining sequential patterns with indices. Knowl. Based Syst. 239: 107946 (2022) - [j32]Phu Pham, Loan T. T. Nguyen, Ngoc Thanh Nguyen, Witold Pedrycz, Unil Yun, Bay Vo:
ComGCN: Community-Driven Graph Convolutional Network for Link Prediction in Dynamic Networks. IEEE Trans. Syst. Man Cybern. Syst. 52(9): 5481-5493 (2022) - [j31]Lam B. Q. Nguyen, Ivan Zelinka, Václav Snásel, Loan T. T. Nguyen, Bay Vo:
Subgraph mining in a large graph: A review. WIREs Data Mining Knowl. Discov. 12(4) (2022) - 2021
- [j30]Tram Nguyen, Loan T. T. Nguyen, Toan Bui, Ho Dac Loc, Witold Pedrycz, Václav Snásel, Bay Vo:
Multi-Swarm Optimization for Extracting Multiple-Choice Tests From Question Banks. IEEE Access 9: 32131-32148 (2021) - [j29]Lam B. Q. Nguyen, Loan T. T. Nguyen, Ivan Zelinka, Václav Snásel, Hung Son Nguyen, Bay Vo:
A Method for Closed Frequent Subgraph Mining in a Single Large Graph. IEEE Access 9: 165719-165733 (2021) - [j28]Bao Huynh, Loan T. T. Nguyen, Huy Minh Huynh, Adrianna Kozierkiewicz, Unil Yun, Zuzana Komínková Oplatková, Bay Vo:
A Novel Approach for Mining Closed Clickstream Patterns. Cybern. Syst. 52(5): 328-349 (2021) - [j27]Trinh D. D. Nguyen, Loan T. T. Nguyen, Lung Vu, Bay Vo, Witold Pedrycz:
Efficient algorithms for mining closed high utility itemsets in dynamic profit databases. Expert Syst. Appl. 186: 115741 (2021) - [j26]Trang T. D. Nguyen, Loan T. T. Nguyen, Anh Nguyen, Unil Yun, Bay Vo:
A method for efficient clustering of spatial data in network space. J. Intell. Fuzzy Syst. 40(6): 11653-11670 (2021) - [j25]Dang Nguyen, Wei Luo, Bay Vo, Loan T. T. Nguyen, Witold Pedrycz:
Con2Vec: Learning embedding representations for contrast sets. Knowl. Based Syst. 229: 107382 (2021) - 2020
- [j24]Bay Vo, Loan T. T. Nguyen, Nguyen Bui, Trinh D. D. Nguyen, Van-Nam Huynh, Tzung-Pei Hong:
An Efficient Method for Mining Closed Potential High-Utility Itemsets. IEEE Access 8: 31813-31822 (2020) - [j23]Bay Vo, Loan T. T. Nguyen, Trinh D. D. Nguyen, Philippe Fournier-Viger, Unil Yun:
A Multi-Core Approach to Efficiently Mining High-Utility Itemsets in Dynamic Profit Databases. IEEE Access 8: 85890-85899 (2020) - [j22]Bay Vo, Le V. Nguyen, Vinh V. Vu, Mi T. H. Lam, Thuy T. M. Duong, Ly T. Manh, Thuy T. T. Nguyen, Loan T. T. Nguyen, Tzung-Pei Hong:
Mining Correlated High Utility Itemsets in One Phase. IEEE Access 8: 90465-90477 (2020) - [j21]Thanh-Ngo Nguyen, Loan T. T. Nguyen, Bay Vo, Ngoc Thanh Nguyen, Trinh D. D. Nguyen:
An N-List-Based Approach for Mining Frequent Inter-Transaction Patterns. IEEE Access 8: 116840-116855 (2020) - [j20]Loan T. T. Nguyen, Dinh-Bao Vu, Trinh D. D. Nguyen, Bay Vo:
Mining Maximal High Utility Itemsets on Dynamic Profit Databases. Cybern. Syst. 51(2): 140-160 (2020) - [j19]Huy Minh Huynh, Loan T. T. Nguyen, Bay Vo, Anh Nguyen, Vincent S. Tseng:
Efficient methods for mining weighted clickstream patterns. Expert Syst. Appl. 142 (2020) - [j18]Huy Minh Huynh, Loan T. T. Nguyen, Bay Vo, Unil Yun, Zuzana Komínková Oplatková, Tzung-Pei Hong:
Efficient algorithms for mining clickstream patterns using pseudo-IDLists. Future Gener. Comput. Syst. 107: 18-30 (2020) - [j17]Thang Mai, Loan T. T. Nguyen, Bay Vo, Unil Yun, Tzung-Pei Hong:
Efficient Algorithm for Mining Non-Redundant High-Utility Association Rules. Sensors 20(4): 1078 (2020) - 2019
- [j16]Loan T. T. Nguyen, Vinh V. Vu, Mi T. H. Lam, Thuy T. M. Duong, Ly T. Manh, Thuy T. T. Nguyen, Bay Vo, Hamido Fujita:
An efficient method for mining high utility closed itemsets. Inf. Sci. 495: 78-99 (2019) - [j15]Loan T. T. Nguyen, Bay Vo, Thanh-Ngo Nguyen, Anh Nguyen:
Mining class association rules on imbalanced class datasets. J. Intell. Fuzzy Syst. 37(6): 7131-7139 (2019) - [j14]Loan T. T. Nguyen, Phuc Nguyen, Trinh D. D. Nguyen, Bay Vo, Philippe Fournier-Viger, Vincent S. Tseng:
Mining high-utility itemsets in dynamic profit databases. Knowl. Based Syst. 175: 130-144 (2019) - 2018
- [j13]Linh T. T. Nguyen, Bay Vo, Loan T. T. Nguyen, Philippe Fournier-Viger, Ali Selamat:
ETARM: an efficient top-k association rule mining algorithm. Appl. Intell. 48(5): 1148-1160 (2018) - [j12]Loan T. T. Nguyen, Ngoc Thanh Nguyen, Bay Vo, Hung Son Nguyen:
Efficient method for updating class association rules in dynamic datasets with record deletion. Appl. Intell. 48(6): 1491-1505 (2018) - 2017
- [j11]Thang Mai, Bay Vo, Loan T. T. Nguyen:
A lattice-based approach for mining high utility association rules. Inf. Sci. 399: 81-97 (2017) - [j10]Thang Mai, Loan T. T. Nguyen:
An efficient approach for mining closed high utility itemsets and generators. J. Inf. Telecommun. 1(3): 193-207 (2017) - [j9]Loan T. T. Nguyen, Truc Trinh, Ngoc Thanh Nguyen, Bay Vo:
A method for mining top-rank-k frequent closed itemsets. J. Intell. Fuzzy Syst. 32(2): 1297-1305 (2017) - 2016
- [j8]Loan T. T. Nguyen, Ngoc Thanh Nguyen, Bogdan Trawinski:
A Quick Method for Querying Top-k Rules from Class Association Rule Set. J. Univers. Comput. Sci. 22(6): 822-835 (2016) - [j7]Dang Nguyen, Loan T. T. Nguyen, Bay Vo, Witold Pedrycz:
Efficient mining of class association rules with the itemset constraint. Knowl. Based Syst. 103: 73-88 (2016) - 2015
- [j6]Loan T. T. Nguyen, Ngoc Thanh Nguyen:
Updating mined class association rules for record insertion. Appl. Intell. 42(4): 707-721 (2015) - [j5]Loan T. T. Nguyen, Ngoc Thanh Nguyen:
An improved algorithm for mining class association rules using the difference of Obidsets. Expert Syst. Appl. 42(9): 4361-4369 (2015) - [j4]Loan T. T. Nguyen, Bay Vo, Tzung-Pei Hong:
CARIM: an efficient algorithm for mining class-association rules with interestingness measures. Int. Arab J. Inf. Technol. 12(6A): 627-634 (2015) - [j3]Dang Nguyen, Loan T. T. Nguyen, Bay Vo, Tzung-Pei Hong:
A novel method for constrained class association rule mining. Inf. Sci. 320: 107-125 (2015) - 2013
- [j2]Loan T. T. Nguyen, Bay Vo, Tzung-Pei Hong, Hoang Chi Thanh:
CAR-Miner: An efficient algorithm for mining class-association rules. Expert Syst. Appl. 40(6): 2305-2311 (2013) - 2012
- [j1]Loan T. T. Nguyen, Bay Vo, Tzung-Pei Hong, Hoang Chi Thanh:
Classification based on association rules: A lattice-based approach. Expert Syst. Appl. 39(13): 11357-11366 (2012)
Conference and Workshop Papers
- 2024
- [c31]Quang-Dieu Nguyen, Tu Anh Hoang Nguyen, Nguyen Tien Dat Pham, Trung Kien Nguyen, Phu Pham, Ngoc-Thanh Nguyen, Loan T. T. Nguyen:
Investigation of Machine Learning and Deep Learning Approaches for Early PM2.5 Forecasting: A Case Study in Vietnam. ICCCI (1) 2024: 305-317 - [c30]Trinh D. D. Nguyen, N. T. Tung, Loan T. T. Nguyen, Bay Vo:
Efficiently Discover Multi-level Maximal High-Utility Patterns from Hierarchical Databases. ICCCI (1) 2024: 382-393 - 2023
- [c29]Tuan M. Le, Trinh D. D. Nguyen, Loan T. T. Nguyen, Adrianna Kozierkiewicz, N. T. Tung:
Extracting Top-k High Utility Patterns from Multi-level Transaction Databases. ACIIDS (1) 2023: 296-306 - [c28]Loan T. T. Nguyen, Anh N. H. Pham, Trinh D. D. Nguyen, Adrianna Kozierkiewicz, Bay Vo, N. T. Tung:
Efficient Pruning Strategy for Mining High Utility Quantitative Itemsets. ICCCI (CCIS Volume) 2023: 326-338 - 2022
- [c27]Phu-Qui Vo, Nhan Tam Dang, Q. Phu Nguyen, An Mai, Loan T. T. Nguyen, Quoc-Thông Nguyen, Ngoc Thanh Nguyen:
Auto Machine Learning-Based Approach for Source Printer Identification. ACIIDS (Companion) 2022: 668-680 - [c26]Adrianna Kozierkiewicz, Marcin Pietranik, Mateusz Olsztynski, Loan T. T. Nguyen:
Updating the Result Ontology Integration at the Concept Level in the Event of the Evolution of Their Components. ICCCI 2022: 51-64 - 2021
- [c25]Trinh D. D. Nguyen, Loan T. T. Nguyen, Adrianna Kozierkiewicz, Thiet Pham, Bay Vo:
An Efficient Approach for Mining High-Utility Itemsets from Multiple Abstraction Levels. ACIIDS 2021: 92-103 - [c24]Hoang-Lam Nguyen, Loan T. T. Nguyen, Adrianna Kozierkiewicz:
Mining Class Association Rules on Dataset with Missing Data. ACIIDS 2021: 104-116 - [c23]N. T. Tung, Loan T. T. Nguyen, Trinh D. D. Nguyen, Adrianna Kozierkiewicz:
Cross-Level High-Utility Itemset Mining Using Multi-core Processing. ICCCI 2021: 467-479 - 2020
- [c22]Adrianna Kozierkiewicz, Marcin Pietranik, Loan T. T. Nguyen:
Updating Ontology Alignment on the Instance Level Based on Ontology Evolution. DEXA (2) 2020: 301-311 - [c21]Nguyen Thi Thuy Loan, Trinh D. D. Nguyen, Anh Nguyen, Phuoc-Nghia Tran, Cuong Trinh, Bao Huynh, Bay Vo:
Efficient Method for Mining High-Utility Itemsets Using High-Average Utility Measure. ICCCI 2020: 305-315 - [c20]Thanh-Ngo Nguyen, Nguyen Thi Thuy Loan, Bay Vo, Adrianna Kozierkiewicz:
Efficient Method for Mining Maximal Inter-transaction Patterns. ICCCI 2020: 316-327 - [c19]Huy Minh Huynh, Nam Ngoc Pham, Zuzana Komínková Oplatková, Nguyen Thi Thuy Loan, Bay Vo:
Sequential Pattern Mining Using IDLists. ICCCI 2020: 341-353 - [c18]Bartosz Kardas, Mateusz Piwowarczyk, Zbigniew Telec, Bogdan Trawinski, Patient Zihisire Muke, Nguyen Thi Thuy Loan:
A Method for Building Heterogeneous Ensembles of Regression Models Based on a Genetic Algorithm. ICCCI 2020: 357-372 - [c17]Sebastian Waloszek, Patient Zihisire Muke, Mateusz Piwowarczyk, Zbigniew Telec, Bogdan Trawinski, Nguyen Thi Thuy Loan:
Usability Study of Data Entry Design Patterns for Mobile Applications. ICCCI 2020: 888-901 - [c16]Thanh-Ngo Nguyen, Loan T. T. Nguyen, Bay Vo, Ngoc Thanh Nguyen:
A Fast Algorithm for Mining Closed Inter-transaction Patterns. IEA/AIE 2020: 820-831 - 2019
- [c15]Huy Minh Huynh, Loan T. T. Nguyen, Bay Vo, Zuzana Komínková Oplatková, Tzung-Pei Hong:
Mining Clickstream Patterns Using IDLists. SMC 2019: 2007-2012 - [c14]Thanh-Ngo Nguyen, Loan T. T. Nguyen, Bay Vo, Ngoc Thanh Nguyen:
An Efficient Algorithm for Mining Frequent Closed Inter- Transaction Patterns. SMC 2019: 2019-2024 - 2018
- [c13]Loan T. T. Nguyen, Bay Vo, Thang Mai, Thanh-Long Nguyen:
A Weighted Approach for Class Association Rules. ACIIDS (Extended Posters) 2018: 213-222 - 2017
- [c12]Loan T. T. Nguyen, Bay Vo, Hung Son Nguyen, Sinh Hoa Nguyen:
Mining Class Association Rules with Synthesis Constraints. ACIIDS (1) 2017: 556-565 - [c11]Linh T. T. Nguyen, Loan T. T. Nguyen, Bay Vo:
An Improved Algorithm for Mining Top-k Association Rules. ICCSAMA 2017: 117-128 - [c10]Thanh-Ngo Nguyen, Loan T. T. Nguyen, Ngoc Thanh Nguyen:
An improved algorithm for mining frequent Inter-transaction patterns. INISTA 2017: 296-301 - [c9]Thanh-Long Nguyen, Bay Vo, Bao Huynh, Václav Snásel, Loan T. T. Nguyen:
Constraint-Based Method for Mining Colossal Patterns in High Dimensional Databases. ISAT (1) 2017: 195-204 - [c8]Loan T. T. Nguyen, Hung Son Nguyen, Sinh Hoa Nguyen:
A Dynamic Packed Approach for Analytic Data Warehouse in Ad-Hoc Queries. ISAT (1) 2017: 205-213 - 2016
- [c7]Loan T. T. Nguyen, Hai T. Nguyen, Bay Vo, Ngoc Thanh Nguyen:
A Method for Query Top-K Rules from Class Association Rule Set. ACIIDS (1) 2016: 644-653 - [c6]Thanh-Long Nguyen, Bay Vo, Loan T. T. Nguyen:
A new method for mining colossal patterns. SMC 2016: 3119-3124 - [c5]Nguyen Bui, Bay Vo, Van-Nam Huynh, Chun-Wei Lin, Loan T. T. Nguyen:
Mining closed high utility itemsets in uncertain databases. SoICT 2016: 7-14 - 2015
- [c4]Loan T. T. Nguyen, Ngoc Thanh Nguyen:
Incremental Mining Class Association Rules Using Diffsets. ICCSAMA 2015: 197-208 - 2014
- [c3]Loan T. T. Nguyen:
Mining Class Association Rules with the Difference of Obidsets. ACIIDS (2) 2014: 72-81 - 2012
- [c2]Loan T. T. Nguyen, Bay Vo, Tzung-Pei Hong, Hoang Chi Thanh:
A fast algorithm for classification based on association rules. GrC 2012: 365-369 - [c1]Loan T. T. Nguyen, Bay Vo, Tzung-Pei Hong, Hoang Chi Thanh:
Interestingness Measures for Classification Based on Association Rules. ICCCI (2) 2012: 383-392
Editorship
- 2017
- [e1]Phan Cong Vinh, Le Tuan Anh, Nguyen Thi Thuy Loan, Waralak Vongdoiwang Siricharoen:
Context-Aware Systems and Applications - 5th International Conference, ICCASA 2016, Thu Dau Mot, Vietnam, November 24-25, 2016, Proceedings. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 193, 2017, ISBN 978-3-319-56356-5 [contents]
Coauthor Index
Adrianna Kozierkiewicz-Hetmanska
aka: Adrianna Kozierkiewicz
aka: Adrianna Kozierkiewicz
[j53] [j51] [j50] [j49] [j48] [j47] [j46] [j45] [j44] [j43] [j42] [j41] [j39] [j38] [j37] [j36] [j35] [j34] [j33] [j32] [j31] [j30] [j29] [j28] [j27] [j26] [j25] [j24] [j23] [j22] [j21] [j20] [j19] [j18] [j17] [j16] [j15] [j14] [j13] [j12] [j11] [j9] [j7] [j4] [j3] [j2] [j1] [c30] [c28] [c25] [c21] [c20] [c19] [c16] [c15] [c14] [c13] [c12] [c11] [c9] [c7] [c6] [c5] [c2] [c1]
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-11-07 21:32 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:
