Search Results (16)

Purpose: Online customer reviews (OCRs) are an essential informational resource in e-commerce, but little is known about the interaction between review type and reader type. This research explores whether consumer’s hedonic or utilitarian personality orientation moderates the relationship between OCR type (hedonic vs. utilitarian) and perceived OCR helpfulness, and whether this moderation is further conditioned by product type. Design/methodology: A 2 (OCR type: hedonic vs. utilitarian) × 2 (product type: bar soap vs. perfume) × 2 (personality type: hedonic vs. utilitarian) mixed factorial experiment was conducted with 586 usable responses collected in South Korea. Review-type and product-type manipulations were validated, personality orientations were measured with established shopping-value scales, and hypotheses were tested using three-way ANOVA with simple-effects decomposition. Findings: Personality orientation significantly moderated the review type–helpfulness relationship (F(1, 586) = 14.67, p < 0.0001), and this moderation was itself qualified by product type (three-way interaction: F(1, 586) = 24.23, p < 0.0001). When the review type was congruent with the product context, personality-mismatched readers—hedonic consumers reading utilitarian reviews and utilitarian consumers reading hedonic reviews—reported the highest helpfulness, whereas reviews that mismatched both the product and the reader received the lowest helpfulness ratings. Implications and originality: The results indicate that review helpfulness is an emergent property of the review–reader–product configuration rather than of review text alone, providing e-commerce platforms with a basis for orientation-aware review ranking, solicitation, and page design. Full article

Background/Objectives: The mTOR serine/threonine kinase coordinates protein translation, cell growth, and metabolism, and its dysregulation promotes tumorigenesis. We present a reproducible, pan-cancer, network-aware framework that integrates curated resources with genomics to move beyond pathway curation, yielding falsifiable hypotheses and prioritized candidates for mTOR axis biomarker validation. Materials and Methods: We assembled MTOR-related genes and interactions from GeneCards, KEGG, STRING, UniProt, and PathCards and harmonized identifiers. We formulated a concise working model linking genotype → pathway architecture (mTORC1/2) → expression-level rewiring → phenotype. Three analyses operationalized this model: (i) pan-cancer alteration mapping to separate widely shared drivers from tumor-specific nodes; (ii) expression-based activity scoring to quantify translational/nutrient-sensing modules; and (iii) topology-aware network propagation (personalized PageRank/Random Walk with Restart on a high-confidence STRING graph) to nominate functionally proximal neighbors. Reproducibility was supported by degree-normalized diffusion, predefined statistical thresholds, and sensitivity analyses. Results: Gene ontology analysis demonstrated significant enrichment for mTOR-related processes (TOR/TORC1 signaling and cellular responses to amino acids). Database synthesis corroborated disease associations involving MTOR and its partners (e.g., TSC2, RICTOR, RPTOR, MLST8, AKT1 across selected carcinomas). Across cohorts, our framework distinguishes broadly shared upstream drivers (PTEN, PIK3CA) from lineage-enriched nodes (e.g., RICTOR-linked components) and prioritizes non-mutated, network-proximal candidates that align with mTOR activity signatures. Conclusions: This study delivers a transparent, pan-cancer framework that unifies curated biology, genomics, and network topology to produce testable predictions about the mTOR axis. By distinguishing shared drivers from tumor-specific nodes and elevating non-mutated, topology-inferred candidates, the approach refines biomarker discovery and suggests architecture-aware therapeutic strategies. The analysis is reproducible and extensible, supporting prospective validation of prioritized candidates and the design of correlative studies that align pathway activity with clinical response. Full article

This study explores the adoption of artificial intelligence (AI) in digital commerce platforms and whether such adoption is aligned with market positioning changes. Focusing on five of the largest e-commerce companies—Amazon, Apple, Shein, Temu, and IKEA—the study examines the application of AI in six key areas of operation: customer service, logistics, personalization, security, and supply chain management. A two-stage qualitative method was employed: a Scopus database-organized literature review, and a walkthrough examination of each company’s home page. There is extensive diversity in the deployment strategies of AI, which business models and digital maturity drive, the findings show. Amazon has end-to-end integration, but newer entrants such as Shein and Temu are concentrating on customer-facing AI tools. Apple, although it uses AI across its ecosystem, illustrates few examples in its online store. Notably, the rankings of firms under study align with their 2023 revenue rankings. Although no cause-and-effect relationship is assumed between the adoption of AI and revenue performance enhancement, the existence of a correlation suggests that AI could facilitate strategic differentiation. A comparative method for analyzing the adoption of AI is proposed in the study and highlights the importance of ethical, organizational, and regulatory concerns. Subsequent research should involve empirical measures of performance, longitudinal monitoring, and user-led assessments to enhance understanding of the impact of AI on digital trade. Full article

This paper studies Google’s PageRank algorithm. By an innovative application of the method of gluing Markov chains, we study the properties of Markov chains and extend their applicability by accounting for the damping factor and the personalization vector. Many properties of Markov chains related to spectrums and eigenvectors of the transition matrix, including the stationary distribution, periodicity, and persistent and transient states, will be investigated as well as part of the gluing process. Using the gluing formula, it is possible to decompose a large network into some sub-networks, compute their PageRank separably and glue them together. The computational workload can be reduced. Full article

In recent years, graph-based learning methods have gained significant traction in point-of-interest (POI) recommendation systems due to their strong generalization capabilities. These approaches commonly transform user check-in records into graph-structured data and leverage graph neural networks (GNNs) to model the representations of both POIs and users. Despite their effectiveness, GNNs face inherent limitations in message passing, which can impede the deep extraction of meaningful representations from the graph structure. To mitigate this challenge, we introduce a novel framework, Multi-view Contextual Graphs via Convolutional Neural Networks for Point-of-Interest Recommendation (MCGRec). The MCGRec framework consists of three primary components. Firstly, it employs a personalized PageRank (PPR) sampling technique based on super nodes to transform the graph-structured data into a grid-like feature matrix. This step is crucial as it prepares the data for subsequent processing by convolutional neural networks (CNNs), which are adept at extracting spatial features from grid-like structures. Secondly, a CNN is utilized to extract the representations of POIs from the constructed feature matrix. The usage of CNNs enables the capture of local patterns and hierarchical features within the data, which are essential for accurate POI representation. Lastly, MCGRec incorporates a novel approach for estimating user preferences that integrates both geographical and temporal factors, thereby providing a more comprehensive model of users’ behaviors. To evaluate the effectiveness of our proposed method, we conduct extensive experiments on real-world datasets. Our results demonstrate that MCGRec outperforms state-of-the-art POI recommendation methods, showcasing its superiority in terms of recommendation accuracy. Full article

Graph representation learning aims to map nodes or edges within a graph using low-dimensional vectors, while preserving as much topological information as possible. During past decades, numerous algorithms for graph representation learning have emerged. Among them, proximity matrix representation methods have been shown to exhibit excellent performance in experiments and scale to large graphs with millions of nodes. However, with the rapid development of the Internet, information interactions are happening at the scale of billions every moment. Most methods for similarity matrix factorization still focus on static graphs, leading to incomplete similarity descriptions and low embedding quality. To enhance the embedding quality of temporal graph learning, we propose a temporal graph representation learning model based on the matrix factorization of Time-constrained Personalize PageRank (TPPR) matrices. TPPR, an extension of personalized PageRank (PPR) that incorporates temporal information, better captures node similarities in temporal graphs. Based on this, we use Single Value Decomposition or Nonnegative Matrix Factorization to decompose TPPR matrices to obtain embedding vectors for each node. Through experiments on tasks such as link prediction, node classification, and node clustering across multiple temporal graphs, as well as a comparison with various experimental methods, we find that graph representation learning algorithms based on TPPR matrix factorization achieve overall outstanding scores on multiple temporal datasets, highlighting their effectiveness. Full article

Creating policy measures is the final step in the process of e-learning roadmap development. Policy measures can be seen as long-term activities that need to be implemented and constantly upgraded to achieve strategic goals. For resource allocation, it is useful to prioritize policy measures. Prioritization can be implemented using multi-criteria decision-making methods. This paper analyzes policy measures in the Maldives National University’s e-learning roadmap using the social network analysis process (SNAP), which includes the analytic hierarchy process (AHP), the decision-making trial and evaluation laboratory (DEMATEL), and the PageRank centrality. In policy measure evaluation, there were more than 20 participants: persons with managerial functions at the Maldives National University (MNU) (deans, heads of departments) and persons in lecturer and researcher positions. By using the AHP, participants prioritized policy measures with respect to their importance to them. By using the DEMATEL, participants identified and prioritized policy measures with respect to their effect on other measures. Finally, by using the SNAP, it was possible to determine the prioritization list for resource allocation since it aggregates the aspects of the policy measures, their importance, and their effect on other measures. Full article

Personalized PageRank (PPR) is a widely used graph processing algorithm used to calculate the importance of source nodes in a graph. Generally, PPR is executed by using a high-performance microprocessor of a server, but it needs to be executed on edge devices to guarantee data privacy and network latency. However, since PPR has a variety of computation/memory characteristics that vary depending on the graph datasets, it causes performance/energy inefficiency when it is executed on edge devices with limited hardware resources. In this paper, we propose HedgeRank, a heterogeneity-aware, energy-efficient, partitioning technique of personalized PageRank at the edge. HedgeRank partitions the PPR subprocesses and allocates them to appropriate edge devices by considering their computation capability and energy efficiency. When combining low-power and high-performance edge devices, HedgeRank improves the execution time and energy consumption of PPR execution by up to 26.7% and 15.2% compared to the state-of-the-art PPR technique. Full article

At present, the existing influence evaluation algorithms often ignore network structure attributes, user interests and the time-varying propagation characteristics of influence. To address these issues, this work comprehensively discusses users’ own influence, weighted indicators, users’ interaction influence and the similarity between user interests and topics, thus proposing a dynamic user influence ranking algorithm called UWUSRank. First, we determine the user’s own basic influence based on their activity, authentication information and blog response. This improves the problem of poor objectivity of initial value on user influence evaluation when using PageRank to calculate user influence. Next, this paper mines users’ interaction influence by introducing the propagation network properties of Weibo (a Twitter-like service in China) information and scientifically quantifies the contribution value of followers’ influence to the users they follow according to different interaction influences, thereby solving the drawback of equal value transfer of followers’ influence. Additionally, we analyze the relevance of users’ personalized interest preferences and topic content and realize real-time monitoring of users’ influence at various time periods during the process of public opinion dissemination. Finally, we conduct experiments by extracting real Weibo topic data to verify the effectiveness of introducing each attribute of users’ own influence, interaction timeliness and interest similarity. Compared to TwitterRank, PageRank and FansRank, the results show that the UWUSRank algorithm improves the rationality of user ranking by 9.3%, 14.2%, and 16.7%, respectively, which proves the practicality of the UWUSRank algorithm. This approach can serve as a guide for research on user mining, information transmission methods, and public opinion tracking in social network-related areas. Full article

Social networks have increasingly become important and popular in modern times. Moreover, the influence of social networks plays a vital role in various organizations, including government organizations, academic research organizations and corporate organizations. Therefore, strategizing the optimal propagation strategy in social networks has also become more important. Increasing the precision of evaluating the propagation probability of social networks can indirectly influence the investment of cost, manpower and time for information propagation to achieve the best return. This study proposes a new algorithm, which includes a scale-free network, Barabási–Albert model, binary-addition tree (BAT) algorithm, PageRank algorithm, Personalized PageRank algorithm and a new BAT algorithm to calculate the propagation probability of social networks. The results obtained after implementing the simulation experiment of social network models show that the studied model and the proposed algorithm provide an effective method to increase the efficiency of information propagation in social networks. In this way, the maximum propagation efficiency is achieved with the minimum investment. Full article

Recently, many models based on the combination of graph convolutional networks and deep learning have attracted extensive attention for their superior performance in graph clustering tasks. However, the existing models have the following limitations: (1) Existing models are limited by the calculation method of graph convolution, and their computational cost will increase exponentially as the graph scale grows. (2) Stacking too many convolutional layers causes the over-smoothing issue and neglects the local graph structure. (3) Expanding the range of the neighborhood and the model depth together is difficult due to the orthogonal relationship between them. Inspired by personalized pagerank and auto-encoder, we conduct the node-wise graph clustering task in the undirected simple graph as the research direction and propose a Scalable Deep Network (SDN) for graph clustering via personalized pagerank. Specifically, we utilize the combination of multi-layer perceptrons and linear propagation layer based on personalized pagerank as the backbone network (i.e., the Quasi-GNN module) and employ a DNN module for auto-encoder to learn different dimensions embeddings. After that, SDN combines the two embeddings correspondingly; then, it utilizes a dual self-supervised module to constrain the training of the embedding and clustering process. Our proposed Quasi-GNN module reduces the computational costs of traditional GNN models in a decoupled approach and solves the orthogonal relationship between the model depth and the neighborhood range. Meanwhile, it also alleviates the degraded clustering effect caused by the over-smoothing issue. We conducted experiments on five widely used graph datasets. The experimental results demonstrate that our model achieves state-of-the-art performance. Full article

Social influence analysis is a very popular research direction. This article analyzes the social network of musicians and the many influencing factors when musicians create music to rank the influence of musicians. In order to achieve the practical purpose of the model making accurate predictions in the broad music market, the algorithm adopts a macromodel and considers the social network topology network. The article adds the time decay function and the weight of genre influence to the traditional PageRank algorithm, and thus, the MRGT (Musician Ranking based on Genre and Time) algorithm appears. Considering the timeliness of social networks and the continuous development of music, we realized the importance of evolving MRGT into a dynamic social network. Therefore, we adopted audio data analysis technology and used Gaussian distance to classify and study the evolution of music properties at different times and different genres and finally formed the dynamic influence ranking algorithm based on musicians’ social and personal information networks. As a macromodel heuristic algorithm, our model is explanatory, can handle batch data and can avoid unfavorable factors, so as to provide fast speed and improved accuracy. The network can obtain an era indicator DMI (Dynamic Music Influence) that measures the degree of music revolution. DMI is the indicator we provide for music companies to invest in musicians. Full article

Symmetry is one of the important properties of Social networks to indicate the co-existence relationship between two persons, e.g., friendship or kinship. Centrality is an index to measure the importance of vertices/persons within a social network. Many kinds of centrality indices have been proposed to find prominent vertices, such as the eigenvector centrality and PageRank algorithm. PageRank-based algorithms are the most popular approaches to handle this task, since they are more suitable for directed networks, which are common situations in social media. However, the realistic problem in social networks is that the process to find true important persons is very complicated, since we should consider both how the influence of a vertex affects others and how many others follow a given vertex. However, past PageRank-based algorithms can only reflect the importance on the one side and ignore the influence on the other side. In addition, past algorithms only view the transition from one status to the next status as a linear process without considering more complicated situations. In this paper, we develop a novel centrality to find key persons within a social network by a proposed synthesized index which accounts for both the inflow and outflow matrices of a vertex. Besides, we propose different transition functions to represent the relationship from status to status. The empirical studies compare the proposed algorithms with the conventional algorithms and show the differences and flexibility of the proposed algorithm. Full article

Since complex search tasks are usually divided into subtasks, providing subtask-oriented query recommendations is an effective way to support complex search tasks. Currently, most subtask-oriented query recommendation methods extract subtasks from plain form search logs consisting of only queries and clicks, providing limited clues to identify subtasks. Meanwhile, for several decades, the Computer Human Interface (CHI)/Human Computer Interaction (HCI) communities have been working on new complex search tools for the purpose of supporting rich user interactions beyond just queries and clicks, and thus providing rich form search logs with more clues for subtask identification. In this paper, we researched the provision of subtask-oriented query recommendations by extracting thematic experiences from the rich form search logs of complex search tasks logged in a proposed visual data structure. We introduce the tree structure of the visual data structure and propose a visual-based subtask identification method based on the visual data structure. We then introduce a personalized PageRank-based method to recommend queries by ranking nodes on the network from the identified subtasks. We evaluated the proposed methods in experiments consisting of informative and tentative search tasks. Full article

Analyzing massive graphs poses challenges due to the vast amount of data available. Extracting smaller relevant subgraphs allows for further visualization and analysis that would otherwise be too computationally intensive. Furthermore, many real data sets are constantly changing, and require algorithms to update as the graph evolves. This work addresses the topic of local community detection, or seed set expansion, using personalized centrality measures, specifically PageRank and Katz centrality. We present a method to efficiently update local communities in dynamic graphs. By updating the personalized ranking vectors, we can incrementally update the corresponding local community. Applying our methods to real-world graphs, we are able to obtain speedups of up to 60× compared to static recomputation while maintaining an average recall of 0.94 of the highly ranked vertices returned. Next, we investigate how approximations of a centrality vector affect the resulting local community. Specifically, our method guarantees that the vertices returned in the community are the highly ranked vertices from a personalized centrality metric. Full article