Catalogue Search | MBRL
Search Results Heading
Explore the vast range of titles available.
MBRLSearchResults
-
DisciplineDiscipline
-
Is Peer ReviewedIs Peer Reviewed
-
Item TypeItem Type
-
SubjectSubject
-
YearFrom:-To:
-
More FiltersMore FiltersSourceLanguage
Done
Filters
Reset
14,952
result(s) for
"User profiles"
Sort by:
DeeProBot: a hybrid deep neural network model for social bot detection based on user profile data
by
Mathew, Sujith
,
Venugopal, Neethu
,
Hayawi, Kadhim
in
Accounts
,
Applications of Graph Theory and Complex Networks
,
Artificial neural networks
2022
Use of online social networks (OSNs) undoubtedly brings the world closer. OSNs like Twitter provide a space for expressing one’s opinions in a public platform. This great potential is misused by the creation of bot accounts, which spread fake news and manipulate opinions. Hence, distinguishing genuine human accounts from bot accounts has become a pressing issue for researchers. In this paper, we propose a framework based on deep learning to classify Twitter accounts as either ‘human’ or ‘bot.’ We use the information from user profile metadata of the Twitter account like description, follower count and tweet count. We name the framework ‘DeeProBot,’ which stands for Deep Profile-based Bot detection framework. The raw text from the description field of the Twitter account is also considered a feature for training the model by embedding the raw text using pre-trained Global Vectors (GLoVe) for word representation. Using only the user profile-based features considerably reduces the feature engineering overhead compared with that of user timeline-based features like user tweets and retweets. DeeProBot handles mixed types of features including numerical, binary, and text data, making the model hybrid. The network is designed with long short-term memory (LSTM) units and dense layers to accept and process the mixed input types. The proposed model is evaluated on a collection of publicly available labeled datasets. We have designed the model to make it generalizable across different datasets. The model is evaluated using two ways: testing on a hold-out set of the same dataset; and training with one dataset and testing with a different dataset. With these experiments, the proposed model achieved AUC as high as 0.97 with a selected set of features.
Journal Article
How to personalize and whether to personalize? Candidate documents decide
2024
Personalized search plays an important role in satisfying users’ information needs owing to its ability to build user profiles based on users’ search histories. Most of the existing personalized methods built dynamic user profiles by emphasizing query-related historical behaviors rather than treating each historical behavior equally. Sometimes, the ambiguity and short nature of the query make it difficult to understand the potential query intent exactly, and the query-centric user profiles built in these cases will be biased and inaccurate. In this work, we propose to leverage candidate documents, which contain richer information than the short query text, to help understand the query intent more accurately and improve the quality of user profiles afterward. Specifically, we intend to better understand the query intent through candidate documents, so that more relevant user behaviors from history can be selected to build more accurate user profiles. Moreover, by analyzing the differences between candidate documents, we can better control the degree of personalization on the ranking of results. This controlled personalization approach is also expected to further improve the stability of personalized search as blind personalization may harm the ranking results. We conduct extensive experiments on two datasets, and the results show that our model significantly outperforms competitive baselines, which confirms the benefit of utilizing candidate documents for personalized web search.
Journal Article
User profiling for Chinese super-new generation wine consumers based on improved density peak clustering algorithm
2025
PurposeFor a better understanding of the preferences and differences of young consumers in emerging wine markets, this study aims to propose a clustering method to segment the super-new generation wine consumers based on their sensitivity to wine brand, origin and price and then conduct user profiles for segmented consumer groups from the perspectives of demographic attributes, eating habits and wine sensory attribute preferences.Design/methodology/approachWe first proposed a consumer clustering perspective based on their sensitivity to wine brand, origin and price and then conducted an adaptive density peak and label propagation layer-by-layer (ADPLP) clustering algorithm to segment consumers, which improved the issues of wrong centers' selection and inaccurate classification of remaining sample points for traditional DPC (DPeak clustering algorithm). Then, we built a consumer profile system from the perspectives of demographic attributes, eating habits and wine sensory attribute preferences for segmented consumer groups.FindingsIn this study, 10 typical public datasets and 6 basic test algorithms are used to evaluate the proposed method, and the results showed that the ADPLP algorithm was optimal or suboptimal on 10 datasets with accuracy above 0.78. The average improvement in accuracy over the base DPC algorithm is 0.184. As an outcome of the wine consumer profiles, sensitive consumers prefer wines with medium prices of 100–400 CNY and more personalized brands and origins, while casual consumers are fond of popular brands, popular origins and low prices within 50 CNY. The wine sensory attributes preferred by super-new generation consumers are red, semi-dry, semi-sweet, still, fresh tasting, fruity, floral and low acid.Practical implicationsYoung Chinese consumers are the main driver of wine consumption in the future. This paper provides a tool for decision-makers and marketers to identify the preferences of young consumers quickly which is meaningful and helpful for wine marketing.Originality/valueIn this study, the ADPLP algorithm was introduced for the first time. Subsequently, the user profile label system was constructed for segmented consumers to highlight their characteristics and demand partiality from three aspects: demographic characteristics, consumers' eating habits and consumers' preferences for wine attributes. Moreover, the ADPLP algorithm can be considered for user profiles on other alcoholic products.
Journal Article
IGA-SOMK + + : a new clustering method for constructing web user profiles of older adults in China
2024
Mining user data and constructing web user profiles of older adults from the perspective of elderly services is conducive to understanding their behavioral habits, needs, and usage preferences on the web, which provides more targeted elderly care services. In this paper, IGA-SOMK + + , which is a novel clustering method for constructing web user profiles of older adults, is proposed based on the China Family Panel Studies (CFPS) survey data, which include 6596 older adults aged greater than 60 years. The selected data aspects include basic information, work situation, health situation, living habits, and web use services. To describe the web user profiles of older adults, a hybrid method based on improved genetic algorithm (IGA) feature selection, self-organizing feature maps (SOM), and K-means + + is proposed. Data on older adults’ web use behaviors are first processed, and IGA is used for feature selection based on the adaptive crossover and mutation probabilities. SOM is then used to determine the initial center vectors of K-means + + for further clustering, which is referred to as SOMK + + (SOM-K-means + +). The results of IGA-SOMK + + are compared with those of the state-of-the-art methods, including the K-means, mini batch K-means, Agnes, K-modes, FCM, K-means + + , SOMK + + , and IHPSO-KM. In addition, the significance and robustness of IGA-SOMK + + are analyzed. The experimental results show that the IGA feature selection reduces the influence of the redundant feature factors and improves the performance of the clustering algorithm. SOMK + + overcomes the sensitivity of K-means to initial cluster centers. Moreover, IGA-SOMK + + has the best clustering effect among the compared algorithms in terms of silhouette coefficient (SC), calinski-harabaz (CH) index, and davies-bouldin (DB) metrics. For example, it increases the SC from 0.280 to 0.629. Finally, by analyzing the results, the user group of older adults is segmented to perform the deep mining of CFPS data, which verifies the feasibility of the user profile model. This paper summarizes the basic situation of the current web access of older adults in China in terms of web use services, as well as the importance of the web in their lives and in the information channels. It also provides suggestions for the current problems of older adults in accessing the web.
Journal Article
User Profile Construction Based on High-Dimensional Features Extracted by Stacking Ensemble Learning
2025
Online social networks, as platforms for personal expression, have evolved into complex networks integrating political and social dimensions. This evolution has shifted the focus of network governance from addressing hacking activities to mitigating unpredictable social behaviors, such as the malicious manipulation of public opinion, the doxing of ordinary users, and cyberbullying. However, the sparsity of data and the concealed nature of user behavior pose significant challenges to existing network reconnaissance technologies. In this study, we focus on constructing user profiles on online social network platforms by extracting features to build deep user profiles based on behavioral patterns. Drawing inspiration from the 5Cs principle of credit evaluation, we refine it into a 3Cs principle tailored for user profiling on social network platforms and associate it with user behavioral patterns. To further analyze user behavior, a high-dimensional feature extraction method is proposed using an improved stacking ensemble learning model. Based on experimental data analysis, the most suitable base algorithms for high-dimensional feature extraction are identified. Experimental results demonstrate that the integration of high-dimensional features improved the behavior prediction accuracy of the profiling model by 9.26% on balanced datasets and enhanced the AUC (area under the curve) metric by 3.69% on imbalanced datasets. The proposed method effectively increases the depth and generalization performance of user profiling.
Journal Article
A User Profile of Tendering and Bidding Corruption in the Construction Industry Based on SOM Clustering: A Case Study of China
2022
Tendering and bidding is considered the stage most vulnerable to corruption in the construction industry. The prevalence of collusive tendering and bidding induces frequent accidents and even sabotages the fairness of the construction market. Although a large number of tendering and bidding corruption cases are investigated in China every year, this information has not been fully exploited. The profile of the different corruptors remains vague. Therefore, this study uses the user profile method to establish a corruptor characteristic model based on the human paradigm, where 1737 tendering and bidding collusion cases were collected from China to extract the features. Four types of specific corruption groups are detected based on self-organizing feature map (SOM) cluster analysis, comprising low-age corruptors, grassroots mild corruptors, middle-level collapsing corruptors, and top leader corruptors. Furthermore, the profiles of different cluster corruptors are described in detail from four dimensions. This study reveals the law of tendering and bidding corruption from the perspective of the user profile and suggests that a user profile system for corruption in bidding should be developed in the process of the precise control of corruption, which promotes the transformation from strike after corruption to prevention beforehand. It is conducive to forming the resultant force of big data for precise anti-corruption.
Journal Article
A Machine Learning Approach to User Profiling for Data Annotation of Online Behavior
2024
The user’s intent to seek online information has been an active area of research in user profiling. User profiling considers user characteristics, behaviors, activities, and preferences to sketch user intentions, interests, and motivations. Determining user characteristics can help capture implicit and explicit preferences and intentions for effective user-centric and customized content presentation. The user’s complete online experience in seeking information is a blend of activities such as searching, verifying, and sharing it on social platforms. However, a combination of multiple behaviors in profiling users has yet to be considered. This research takes a novel approach and explores user intent types based on multidimensional online behavior in information acquisition. This research explores information search, verification, and dissemination behavior and identifies diverse types of users based on their online engagement using machine learning. The research proposes a generic user profile template that explains the user characteristics based on the internet experience and uses it as ground truth for data annotation. User feedback is based on online behavior and practices collected by using a survey method. The participants include both males and females from different occupation sectors and different ages. The data collected is subject to feature engineering, and the significant features are presented to unsupervised machine learning methods to identify user intent classes or profiles and their characteristics. Different techniques are evaluated, and the K-Mean clustering method successfully generates five user groups observing different user characteristics with an average silhouette of 0.36 and a distortion score of 1136. Feature average is computed to identify user intent type characteristics. The user intent classes are then further generalized to create a user intent template with an Inter-Rater Reliability of 75%. This research successfully extracts different user types based on their preferences in online content, platforms, criteria, and frequency. The study also validates the proposed template on user feedback data through Inter-Rater Agreement process using an external human rater.
Journal Article
AQST-ClustNet: Hybrid Aquila Quantum Sooty Tern Optimization for User Profile Clustering in Social Network
by
Sujihelen, L.
,
Singh, C. Senthil
,
Babu, K. Dinesh
in
Accuracy
,
Algorithms
,
Artificial Intelligence
2025
User profile clustering is the process of grouping users on social media sites based on common characteristics identified in their profile data, such as demographics, interests, and interactions. Profile clustering allows users to engage in targeted marketing, skill-matching, and collaborative networking by grouping them based on similar attributes, interests, or professional criteria. However, one key drawback of user profile clustering is its sensitivity to noisy and missing data, high-dimensional feature spaces, poor semantic understanding, and complexity limitations. To overcome these issues, a novel Hybrid Aquila Quantum Sooty tern optimization for clustering (AQST-ClustNet) approach based on user profiles (UP) has been proposed in this paper. The user profile data is preprocessed using NLP techniques involving data stemming, handling of missing data or values, removal of stop words, and data extraction for eliminating inappropriate data. A Hybrid Aquila Quantum Sooty Tern Optimization (HAQSTO) algorithm is employed for clustering the user profile into healthcare professionals, marketing professionals, software developers, and educators. The efficiency of the developed method is assessed employing various metrics, including Calinski–Harabasz score (CHS), Silhouette score (SHS), and Davies–Bouldin score (DBS). The proposed model achieves less runtime of 45 s, whereas the existing techniques, such as MCEMS, DBSTexC, and TSMIUSC-Miner, achieve runtimes of 70 s, 79 s, and 60 s. Using the effective dual-stage feature extraction and clustering approach, the complexity of clustering and a high-dimensional feature space is effectively reduced.
Journal Article
Semantic Web-Based User Profile Modeling for Reading Promotion and Collaborative Library-Student Club Engagement
2025
In the context of the digital age, traditional reading promotion models are no longer able to meet the diverse needs of modern users. In order to cultivate reading habits among college students and improve their reading rate, this study constructed a semantic user profile model for reading promotion, which deeply analyzed users' reading preferences, behavioral characteristics, and differences in needs and achieved precise reading promotion services. This study integrated sentiment analysis techniques to extract users' emotional tendencies toward reading materials, enabling a more refined understanding of user preferences and engagement. At the same time, this study further explored the innovative model of libraries collaborating with student clubs to improve the quality of library services and enhance effective reading promotion.
Journal Article
Research paper recommender system based on public contextual metadata
by
Haruna, Khalid
,
Qazi, Atika
,
Chiroma, Haruna
in
Alternative approaches
,
Citations
,
Collaboration
2020
Due to the exponential increase in research papers on a daily basis, finding and accessing related academic documents over the Internet is monotonous. One of the leading approaches was the use of recommendation systems to proactively recommend scholarly papers to individual researchers. The primary drawback to these methods, however, is that their success depends on user profile information and is therefore unable to provide useful suggestions to the new user. In addition, both the public and the non-public used descriptive metadata are used. The scope of the recommendation is therefore limited to a number of documents which are either publicly available or which are granted copyright permits. In alleviating the above problems, we proposed an alternative approach using public contextual metadata for an independent framework that customizes scholarly papers, regardless of the research field and user expertise. Experimental tests have shown significant improvements over other baseline methods.
Journal Article