Jing Shan

dblp:75/5800 · DBLP profile ↗
← Back
11ranked-venue papers in the field
4as first author
4since 2021 · last 2025
—ORCID · conflict

Domains — venue-derived; a paper can count in several

Knowledge Engineering, Semantic Web & Information Systems · 5Database Systems & Data Management · 4 (2 first)Information Retrieval & Web Search · 2 (2 first)
YearPublicationVenuePosition
2025 KSDF: A Knowledge-Based Sensitivity Detection Framework for Film Reviews Using Graph Convolutional Network
Ruichen Liu, Jing Shan, Xiaoxu Song, Haiwen Feng
WISA3
2025 Multi-relational Context Learning with Cross-Attention Augmentation for Human Object Interaction Detection
Wuyou Wang, Jing Shan, Xiaoxu Song
WISA3
2024 Dual Learning Model of Code Summary and Generation Based on Transformer
Lijun Cao, Jing Shan, Xiaoxu Song
WISA3
2024 Attention-Based Spatial-Temporal Fusion Networks for Traffic Flow Prediction
Jing Shan, Xiaoxu Song
WISA3
2015 An Efficient Approach of Overlapping Communities Search
Jing Shan, Derong Shen, Tiezheng Nie, Yue Kou, Ge Yu 0001
DASFAA (1)1
2012 An Entity Class Model Based Correlated Query Path Selection Method in Multiple Domains
Jing Shan, Derong Shen, Tiezheng Nie, Yue Kou, Ge Yu 0001
APWeb1
2011 A Bottom-up Approach of Web Data Extraction based on Entity Recognition and Integration
abstract
Nowadays, most popular methods for web data extraction (WDE) are top-down ones depending on structure. However, these techniques are not scalable enough when coming to complex pages. Consequently, we put forward a bottom-up approach for WDE based on entity recognition and integration to avoid over dependency to structure of web pages. The approach proposed focuses on primary text sequences labeling first and also gives consideration to repetitive patterns of them as well. We propose a Two-Level extraction model for entity recognition and repetitive pattern extraction algorithm for entity integration. Our approach can effectively reduce the attribute labeling mistakes. Also, we demonstrate our approach by scientifically experimental results. The conclusion is that our approach perform better than the traditional extraction techniques, especially on complex Web pages.
Derong Shen, Jing Shan, Tiezheng Nie, Yue Kou
WISA3
2011 A Self-adaptive Cross-Domain Query Approach on the Deep Web
Yingjun Li, Derong Shen, Tiezheng Nie, Ge Yu 0001, Jing Shan, Yue Kou
WAIM5
2010 An Effective and High-quality Query Relaxation Solution on the Deep Web
abstract
Because the amount of information contained on the Deep Web is much larger than the surface web, how to use it well has become a popular problem to research. When a query is sent to a deep web resource and the data sources return few results or even no result, a proper query relaxation solution should be adopted to get more satisfactory results to users. In this paper, such a query relaxation solution is presented. First, it solves the problem of relaxing attributes which contain multiple key words by value. That is, such attributes are not simply removed in the relaxation, but the query values of the attributes are modified. Second, when a data source returns many result pages, instead of getting all the pages, it evaluates the quality of the results in the current page to decide whether to send another query to fetch the next page. Thus, the number of query times is reduced. Finally, the experimental results demonstrate that both the result quality and the query efficiency are improved.
Jing Shan, Derong Shen, Tiezheng Nie, Yue Kou, Ge Yu 0001
APWeb1
2004 A Framework for Access Methods for Versioned Data
Betty Salzberg, Linan Jiang, David B. Lomet, Manuel Barrena García, Jing Shan, Evangelos Kanoulas
EDBT5
2003 On Spatial-Range Closest-Pair Query
Jing Shan, Betty Salzberg
SSTD1