The European Conference on Case-Based Reasoning (CBR) in 2008 marked IS years of international and European CBR conferences where almost seven hundred research papers were published. In this report we review the resea...
详细信息
Influence between objects needs to be assessed in many applications. Lots of measures have been proposed, but a domain-independent method is still expected. In this paper, we give a probabilistic definition of influen...
详细信息
Influence between objects needs to be assessed in many applications. Lots of measures have been proposed, but a domain-independent method is still expected. In this paper, we give a probabilistic definition of influence based on the random walker model on graphs. Two approaches, linear systems method and Basic InfRank algorithm, are shown and return equal results, but Basic InfRank is more efficient by iterative computation. Two variants on bipartite graphs and star graphs are discussed. Experiments show InfRank algorithms have good accuracy, fast convergent rate and high performance.
Point-of-Interest (POI) recommendation, pivotal for guiding users to their next interested locale, grapples with the persistent challenge of data sparsity. Whereas knowledge graphs (KGs) have emerged as a favored tool...
Point-of-Interest (POI) recommendation, pivotal for guiding users to their next interested locale, grapples with the persistent challenge of data sparsity. Whereas knowledge graphs (KGs) have emerged as a favored tool to mitigate the issue, existing KG-based methods tend to overlook two crucial elements: the intention steering users’ location choices and the high-order topological structure within the KG. In this paper, we craft an Intention-aware knowledge Graph (IKG) that harmonizes users’ visit histories, movement trajectories, and location categories to model user intentions. Building upon IKG, our novel Intention-aware knowledge Graph Network (IKGN) delves deeper into the POI recommendation by weighing and propagating node embeddings through an attention mechanism, capturing the unique locational intent of each user. A sequential model like GRU is then employed to ensure a comprehensive representation of users’ short- and long-term location preferences. An empirical study on two real-world datasets validates the effectiveness of our proposed IKGN, with it markedly outshining seven benchmark rival models in both Recall and NDCG metrics. The code of IKGN is available at https://***/Jungle123456/IKGN.
MOOCs (Massive Open Online Courses) are a key tool for open education stakeholders and high-level universities to face the problem of limited resources and make education accessible worldwide. Our study relies on the ...
详细信息
ISBN:
(数字)9781728142166
ISBN:
(纸本)9781728142173
MOOCs (Massive Open Online Courses) are a key tool for open education stakeholders and high-level universities to face the problem of limited resources and make education accessible worldwide. Our study relies on the hypothesis of the influence of learning adaptation on the learners' lack of motivation in MOOCs. In this sense, a recommendation approach could stimulate the learner's interest in specific MOOCs. In previous research, we have identified the recommendation criteria to recommend MOOCs adapted to the learner's needs and motivations. Then, we modeled the ontology of the learning actors' profiles for the matching of the characteristics of learners with adapted MOOCs. Afterward, we designed the functional architecture and use cases of a semantic recommendation system to stimulate learners' interest in MOOCs. However, the recommendation process is still hindered by the learner profile on these platforms that doesn't represent the learner's interests and motivations. Yet, social media profiles extraction can be an external data source for learners' profile enrichment. So, the purpose of this research is to use social media mining for the acquisition of personal and professional data about learners. Therefore, we apply the first phases of data mining on a social media dataset to explore the potentially meaningful data for MOOC recommendation.
Life expectancy at older ages has seen an increment in the past 100 years and factors influencing longevity are since being studied. Public health sectors (PHS) across the globe are trying hard to understand longevity...
详细信息
Wireless Sensor Networks (WSNs) are made up of tiny sensor nodes which sense the data and communicate to the base station via other nodes. These sensor nodes are inexpensive portable devices with limited processing po...
详细信息
Wireless Sensor Networks (WSNs) are made up of tiny sensor nodes which sense the data and communicate to the base station via other nodes. These sensor nodes are inexpensive portable devices with limited processing power and energy resources which make them in need of smart clustering protocols. Many clustering and routing protocols were proposed in the literature to serve large networks of such tiny devices. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These clustering protocols are compared in different terms such as residual energy, data delivery to the base station, maximum number of rounds and the number of live nodes. Experimental results showed a better performance of the LEACH protocols when compared to the different versions of HEED. Moreover, LEACH-1R proved to be efficient in terms of network lifetime.
Recent studies have shown the promise of direct data processing on hierarchically-compressed text documents. By removing the need for decompressing data, the direct data processing technique brings large savings in bo...
详细信息
ISBN:
(数字)9781728129037
ISBN:
(纸本)9781728129044
Recent studies have shown the promise of direct data processing on hierarchically-compressed text documents. By removing the need for decompressing data, the direct data processing technique brings large savings in both time and space. However, its benefits have been limited to data traversal operations; for random accesses, direct data processing is several times slower than the state-of-the-art baselines. This paper presents a set of techniques that successfully eliminate the limitation, and for the first time, establishes the feasibility of effectively handling both data traversal operations and random data accesses on hierarchically-compressed data. The work yields a new library, which achieves 3.1× speedup over the state-of-the-art on random data accesses to compressed data, while preserving the capability of supporting traversal operations efficiently and providing large (3.9×) space savings.
A new concept Graded Finite Poset is proposed in this paper. Through discussing some basic properties of it, we come to that the direct product of graded finite posets is connected if and only if every graded finite p...
详细信息
A new concept Graded Finite Poset is proposed in this paper. Through discussing some basic properties of it, we come to that the direct product of graded finite posets is connected if and only if every graded finite poset is connected. The graded function of a graded finite poset is unique if and only if the graded finite poset is connected.
The pulsar classification represents a major issue in the astrophysical area. The Bagging Algorithm is an ensemble method widely used to improve the performance of classification algorithms, especially in the case of ...
详细信息
The pulsar classification represents a major issue in the astrophysical area. The Bagging Algorithm is an ensemble method widely used to improve the performance of classification algorithms, especially in the case of pulsar search. In this way, our paper tries to prove how the Bagging Method can improve the performance of pulsar candidate detection in connection with four basic classifiers: Core Vector Machines (CVM), the K-Nearest-Neighbors (KNN), the Artificial Neural Network (ANN), and Cart Decision Tree (CDT). The Error Rate, Area Under the Curve (AUC), and Computation Time (CT) are measured to compare the performance of different classifiers. The High Time Resolution Universe (HTRU2) dataset, collected from the UCI Machine Learning Repository, is used in the experimentation phase.
暂无评论