Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ende Zhang

dblp:40/1568 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
1since 2021 · last 2026
0009-0008-9230-8278ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 50% Data models and query languages · 50%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data models and query languages › uncertain data › probabilistic data
probabilistic XML
0.112009
Holistically Twig Matching in Probabilistic XML · ICDE 2009
Query processing and optimization › XML query processing
twig pattern matching
0.112009
Holistically Twig Matching in Probabilistic XML · ICDE 2009
Algorithms and data structures › signal processing algorithms
filtering algorithms
0.012009
Fast filtering false active subspaces for efficient high dimensional similarity processing · Sci. China Ser. F Inf. Sci. 2009

Methods — techniques the papers use, named apart from their topics

subspace filtering · 0.1probabilistic tag streams · 0.1holistic matching · 0.1dimensionality reduction · 0.1
YearPublicationVenuePosition
2026 CAGMamba: Context-Aware Gated Cross-Modal Mamba Network for Multimodal Sentiment Analysis
Minghai Jiao, Ende Zhang, Shuang Kan, Jinyao Li, Haidong Xin
ICIC (22)4
2017 A Precise Marketing Algorithm Based on Topic Community for New Media Platform
abstract
New media platforms, including the network community, microblogging, WeChat, live show platform, have become the main platforms and channels for information dissemination and diffusion, at the same time, these platforms are also favored by the majority of merchants, and how to use these new media platforms for precise marketing is an urgent problem. This paper proposes a precise marketing algorithm based on topic community discovery, which can use the link relation between user and user and the user generated content to determine the user's community division, then the merchants can put different advertising content for different topic community. The algorithm uses the LDA algorithm to analyze the text information in the user-generated content, and analyzes the link relation between the user and the user through the classical community discovery method, and combines the community structure to discover the network structure. These topic communities are the basis of network precise marketing. Extensive experiments are done using real world data, which prove that the algorithm proposed in this paper can effectively use the user topic and user link relationship to find the topic community, thus providing the basis for precise marketing.
Ende Zhang, Changming Xu
WISA1
2015 Finding critical blocks of information diffusion in social networks
Ende Zhang, Guoren Wang, Kening Gao, Ge Yu 0001
World Wide Web1
2013 Finding Critical Blocks of Information Diffusion in Social Networks
Ende Zhang, Guoren Wang, Kening Gao, Ge Yu 0001
WAIM1
2009 Holistically Twig Matching in Probabilistic XML
abstract
Traditional databases manage only deterministic information, but now many applications that use databases involve uncertain data. For example, it is infeasible for a sensor database to contain only the exact value of each sensor at all points in time. The uncertainty is inherent in these systems due to measurement and sampling errors, and resource limitations. This paper aims at the query processing algorithm of twig patterns on probabilistic XML documents. The existing algorithms evaluate twig patterns in a traversal way. The main shortcoming of this way is scanning the whole probabilistic XML document to get the final results. In this paper, we first represent a probabilistic XML document in the form of probabilistic tag streams and then match them in a holistic way. Extensive experiments are conducted and show that the proposed holistic way has the higher performance than the traversal way.
Yawen Li 0001, Guoren Wang, Junchang Xin, Ende Zhang, Zeling Qiu
ICDE4
2009 Fast filtering false active subspaces for efficient high dimensional similarity processing
Guoren Wang, Ge Yu 0001, Junchang Xin, Yuhai Zhao, Ende Zhang
Sci. China Ser. F Inf. Sci.5