標(biāo)題: Titlebook: Database Systems for Advanced Applications; 23rd International C Jian Pei,Yannis Manolopoulos,Jianxin Li Conference proceedings 2018 Spring [打印本頁] 作者: 戰(zhàn)神 時(shí)間: 2025-3-21 17:27
書目名稱Database Systems for Advanced Applications影響因子(影響力)
書目名稱Database Systems for Advanced Applications影響因子(影響力)學(xué)科排名
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database Systems for Advanced Applications被引頻次
書目名稱Database Systems for Advanced Applications被引頻次學(xué)科排名
書目名稱Database Systems for Advanced Applications年度引用
書目名稱Database Systems for Advanced Applications年度引用學(xué)科排名
書目名稱Database Systems for Advanced Applications讀者反饋
書目名稱Database Systems for Advanced Applications讀者反饋學(xué)科排名
作者: 騎師 時(shí)間: 2025-3-21 21:57
https://doi.org/10.1007/978-3-319-91452-7artificial intelligence; computational linguistics; computer networks; data mining; data security; image 作者: 假 時(shí)間: 2025-3-22 00:23
978-3-319-91451-0Springer International Publishing AG, part of Springer Nature 2018作者: 熱情的我 時(shí)間: 2025-3-22 07:09 作者: 最初 時(shí)間: 2025-3-22 11:09
Isosmotic Fluid Transport across Epithelia,from different perspectives, on one hand, most of the existing methods only focus on leveraging the plain network structure, ignoring the abundant attribute information of nodes. On the other hand, for some methods integrating the attribute information, only the lower-order proximities (e.g. microsc作者: semble 時(shí)間: 2025-3-22 15:26 作者: semble 時(shí)間: 2025-3-22 17:12
Moises Gaviria,Glorianna Montasng network embedding methods mostly focus on unsigned networks and ignore the negative interactions between users. In this paper, we investigate the problem of learning representations for signed networks and present a novel deep network structure to incorporate both the balance and status theory in作者: 兩種語言 時(shí)間: 2025-3-22 22:25 作者: 環(huán)形 時(shí)間: 2025-3-23 02:00
Female Circumcision/Mutilation/Cutting. As a result, POI recommendation systems, which play a vital role in connecting users and POIs, have received extensive attention from both research and industry communities in the past few years. The challenges of POI recommendation come from the very sparse user check-in records with only positiv作者: 手段 時(shí)間: 2025-3-23 08:05
Olusegun Badejoko,Uchenna Onwudiegwuusers or items are elicited, more effective the recommendations are. However, almost all user rating datasets are sparse in the real-world applications. To acquire more ratings, the active learning based methods have been used to selectively choose the items (called interview items) to ask users for作者: 搜集 時(shí)間: 2025-3-23 12:00
Osric Banfegha Navti,Victor N. Chilakas of clothing from tens of thousands available selections. To help common customers overcome selection difficulties, recent studies in the recommender system area have started to infer the fashion matching results automatically. The conventional fashion recommendation is normally achieved by conside作者: 哀悼 時(shí)間: 2025-3-23 15:59
Financialization and Oligarchization while products have different characteristics that attract users. This information can be explicitly exploited from the review text. However, most existing methods only model the review text as a topic preference of products, without considering the perspectives of users and products simultaneously作者: dry-eye 時(shí)間: 2025-3-23 20:30
Oligarchs, Oligarchy, and Oligarchizationalgorithm. Different from most of the CDCF algorithms which tri-factorize the rating matrix of each domain into three low dimensional matrices, LSCD extracts a user and an item latent feature matrix for each domain respectively. Besides, in order to improve the performance of recommendations among c作者: 制定法律 時(shí)間: 2025-3-24 00:08 作者: DIKE 時(shí)間: 2025-3-24 05:14
S. I. Tarapov,S. Yu Polevoy,N. N. Beletski network topology analysis. Due to the complex relationship between different entities, dual graph widely exists in the applications. A dual graph contains a physical graph and a conceptual graph, both of which have the same vertex set. Given that there exist no previous studies on the . in dual gra作者: 可用 時(shí)間: 2025-3-24 07:13
S. I. Tarapov,S. Yu Polevoy,N. N. Beletskiroblem. To identify meaningful communities in a graph, a density-connected tree is first constructed in a local fashion. Building upon the local intuitive density-connected tree, Dcut allows partitioning a graph into multiple densely tight-knit clusters effectively and efficiently. We have demonstra作者: 有斑點(diǎn) 時(shí)間: 2025-3-24 12:43 作者: 暴行 時(shí)間: 2025-3-24 18:14
James W. McAuley,Paul Nesbitt-Larkingr (ANN) query, which reports all nearest neighbors for a given set of query objects. Existing studies on ANN queries have focused on Euclidean space. Given the widespread occurrence of spatial networks in urban environments, we study the ANN query in spatial network settings. An example of an ANN qu作者: Hla461 時(shí)間: 2025-3-24 20:08
Contemporary Orangeism in Canadadestination . in a bicriteria network ., path skyline query aims to identify all the skyline paths from . to . in .. In the literature, . is a fundamental algorithm for path skyline query and is also used as a building block for the afterwards proposed algorithms. In ., a key operation is to record 作者: 宣傳 時(shí)間: 2025-3-25 01:36 作者: 范例 時(shí)間: 2025-3-25 06:23
Enhancing Network Embedding with Auxiliary Information: An Explicit Matrix Factorization Perspectiveix factorization framework. As a consequence, network embedding can be learned in a unified framework integrating network structure and node content as well as label information simultaneously. We demonstrate the efficacy of the proposed model with the tasks of semi-supervised node classification an作者: Glucose 時(shí)間: 2025-3-25 10:04
Attributed Network Embedding with Micro-meso Structureal information including the microscopic proximity structure and mesoscopic community structure. In particular, both the microscopic proximity structure and node attributes are factorized by Nonnegative Matrix Factorization (NMF), from which the low-dimensional node representations can be obtained. 作者: FEAS 時(shí)間: 2025-3-25 12:46 作者: 鉆孔 時(shí)間: 2025-3-25 16:33
Exploiting Context Graph Attention for POI Recommendation in Location-Based Social Networkseference modeling in the collaborative filtering framework..To address the limitations of existing methods, we propose a . (CGA) model, which can integrate context information encoded in different context graphs with the attention mechanism for POI recommendation. CGA first uses two context-aware at作者: insightful 時(shí)間: 2025-3-25 21:39 作者: 你不公正 時(shí)間: 2025-3-26 02:45 作者: defibrillator 時(shí)間: 2025-3-26 06:47
Cross-Domain Recommendation for Cold-Start Users via Neighborhood Based Feature Mappingt feature mapping is proposed to transfer the latent features of a cold-start user from the auxiliary domain?to the target domain. Extensive experiments on two real datasets extracted from Amazon transaction data demonstrate the superiority of our proposed model against other state-of-the-art method作者: 恫嚇 時(shí)間: 2025-3-26 09:04 作者: Ventilator 時(shí)間: 2025-3-26 16:12
Towards Efficient Path Skyline Computation in Bicriteria Networks evaluate our proposed algorithm on real networks and the experimental results demonstrate the efficiency of our proposed algorithm. Besides, the experimental results also demonstrate the algorithm that uses . as a building block for the path skyline query can achieve a significant performance impro作者: jeopardize 時(shí)間: 2025-3-26 16:50
Franklyn G. Knox,William S. Spielmanix factorization framework. As a consequence, network embedding can be learned in a unified framework integrating network structure and node content as well as label information simultaneously. We demonstrate the efficacy of the proposed model with the tasks of semi-supervised node classification an作者: 紡織品 時(shí)間: 2025-3-27 00:12
Isosmotic Fluid Transport across Epithelia,al information including the microscopic proximity structure and mesoscopic community structure. In particular, both the microscopic proximity structure and node attributes are factorized by Nonnegative Matrix Factorization (NMF), from which the low-dimensional node representations can be obtained. 作者: 搬運(yùn)工 時(shí)間: 2025-3-27 02:25 作者: 吞噬 時(shí)間: 2025-3-27 08:59
Female Circumcision/Mutilation/Cuttingeference modeling in the collaborative filtering framework..To address the limitations of existing methods, we propose a . (CGA) model, which can integrate context information encoded in different context graphs with the attention mechanism for POI recommendation. CGA first uses two context-aware at作者: 驚惶 時(shí)間: 2025-3-27 09:28
Olusegun Badejoko,Uchenna Onwudiegwug the next question in the interview process. Second, the interview item set in the decision tree based methods is very small (i.e., usually less than 50 items), which leads to that the interview items cannot fully reflect or capture the diverse user interests, and most items do not have the opportu作者: FORGO 時(shí)間: 2025-3-27 15:01
Osric Banfegha Navti,Victor N. Chilakameaningful yet compact high level features of clothing items, which are represented as binary hash codes. In detail, this learning process is supervised by a clothing matching matrix, which is initially constructed based on limited known matching pairs and subsequently on the self-augmented ones. Th作者: CHIP 時(shí)間: 2025-3-27 18:50
https://doi.org/10.1007/978-3-030-14105-9t feature mapping is proposed to transfer the latent features of a cold-start user from the auxiliary domain?to the target domain. Extensive experiments on two real datasets extracted from Amazon transaction data demonstrate the superiority of our proposed model against other state-of-the-art method作者: Aprope 時(shí)間: 2025-3-28 00:51
James W. McAuley,Paul Nesbitt-Larking theoretically and empirically. Our results show that the algorithm is highly efficient and scalable. It outperforms adapted state-of-the-art nearest neighbor algorithms in both precomputation and query processing costs by more than one order of magnitude.作者: overreach 時(shí)間: 2025-3-28 03:19 作者: 過份艷麗 時(shí)間: 2025-3-28 08:23
https://doi.org/10.1007/978-3-319-28100-1on of the new paradigm and can be implemented easily by using the fundamental external memory primitives. We conduct extensive experiments on real and synthesis graphs and the results demonstrate the efficiency of our proposed algorithm.作者: ITCH 時(shí)間: 2025-3-28 12:30 作者: 辮子帶來幫助 時(shí)間: 2025-3-28 17:13 作者: 男生如果明白 時(shí)間: 2025-3-28 21:33 作者: GAVEL 時(shí)間: 2025-3-29 02:26 作者: FUME 時(shí)間: 2025-3-29 03:39
BASSI: Balance and Status Combined Signed Network Embeddingoting the sign of an edge. Furthermore, the learnt node and edge embeddings can be directly applied to the sign prediction and node ranking tasks. Experiments on real-world social networks demonstrate that our model significantly outperforms the state-of-the-art baselines.作者: 死貓他燒焦 時(shí)間: 2025-3-29 10:33
Learning Dual Preferences with Non-negative Matrix Tri-Factorization for Top-, Recommender Systemventional collaborative filtering in conjunction with topic models, we use non-negative matrix tri-factorization to jointly reveal the characteristic of users and products. Experiments on two real-world data sets validate the effectiveness of our method in Top-. recommendations.作者: relieve 時(shí)間: 2025-3-29 14:27 作者: 彎彎曲曲 時(shí)間: 2025-3-29 18:54
Conference proceedings 2018 text and data mining; medical data mining; security and privacy; search and information retrieval; query processing and optimizations; data quality and crowdsourcing; learning models; multimedia data processing; and distributed computing.? ?.作者: 不規(guī)則的跳動(dòng) 時(shí)間: 2025-3-29 20:29 作者: 討厭 時(shí)間: 2025-3-30 01:05 作者: delegate 時(shí)間: 2025-3-30 04:22
Oligarchs, Oligarchy, and Oligarchizationparse matrix is used to characterize the discriminative features in each specific domain. Extensive experiments on two real-world datasets have been conducted to confirm that the proposed algorithm transfers knowledge in a better way to improve the quality of recommendation and outperforms the state-of-the-art recommendation algorithms.作者: 嚙齒動(dòng)物 時(shí)間: 2025-3-30 11:19 作者: 懶惰人民 時(shí)間: 2025-3-30 13:32
S. I. Tarapov,S. Yu Polevoy,N. N. Beletskis a connectivity map of vertices in a graph from a local density perspective. We systematically evaluate our new clustering approach on synthetic and real-world data sets to demonstrate its good performance.作者: 偽證 時(shí)間: 2025-3-30 17:43 作者: Thyroiditis 時(shí)間: 2025-3-31 00:31
Low-Rank and Sparse Cross-Domain Recommendation Algorithmparse matrix is used to characterize the discriminative features in each specific domain. Extensive experiments on two real-world datasets have been conducted to confirm that the proposed algorithm transfers knowledge in a better way to improve the quality of recommendation and outperforms the state-of-the-art recommendation algorithms.作者: micturition 時(shí)間: 2025-3-31 00:56 作者: prediabetes 時(shí)間: 2025-3-31 06:43 作者: Bucket 時(shí)間: 2025-3-31 09:33
