• Title/Summary/Keyword: User Internet

Search Result 4,246, Processing Time 0.048 seconds

User Bias Drift Social Recommendation Algorithm based on Metric Learning

  • Zhao, Jianli;Li, Tingting;Yang, Shangcheng;Li, Hao;Chai, Baobao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.12
    • /
    • pp.3798-3814
    • /
    • 2022
  • Social recommendation algorithm can alleviate data sparsity and cold start problems in recommendation system by integrated social information. Among them, matrix-based decomposition algorithms are the most widely used and studied. Such algorithms use dot product operations to calculate the similarity between users and items, which ignores user's potential preferences, reduces algorithms' recommendation accuracy. This deficiency can be avoided by a metric learning-based social recommendation algorithm, which learns the distance between user embedding vectors and item embedding vectors instead of vector dot-product operations. However, previous works provide no theoretical explanation for its plausibility. Moreover, most works focus on the indirect impact of social friends on user's preferences, ignoring the direct impact on user's rating preferences, which is the influence of user rating preferences. To solve these problems, this study proposes a user bias drift social recommendation algorithm based on metric learning (BDML). The main work of this paper is as follows: (1) the process of introducing metric learning in the social recommendation scenario is introduced in the form of equations, and explained the reason why metric learning can replace the click operation; (2) a new user bias is constructed to simultaneously model the impact of social relationships on user's ratings preferences and user's preferences; Experimental results on two datasets show that the BDML algorithm proposed in this study has better recommendation accuracy compared with other comparison algorithms, and will be able to guarantee the recommendation effect in a more sparse dataset.

Differences of Psychosocial Vulnerability Factors between Internet and Smartphone Addiction Groups Consisting of Children and Adolescents in a Small to Medium-Sized City (일 중소도시 소아청소년의 인터넷 및 스마트폰중독 수준에 따른 심리사회적 취약요인의 차이)

  • Jun, Young-Soon;Kim, Tae-Ho;Shin, Yong-Tae;Jo, Seongwoo
    • Journal of the Korean Academy of Child and Adolescent Psychiatry
    • /
    • v.27 no.3
    • /
    • pp.188-195
    • /
    • 2016
  • Objectives: The aim of this study was to investigate the relationship between internet addiction, smartphone addiction, and psychosocial factors. This study was designed to examine the vulnerability factors for internet and smartphone addiction. Methods: The participants were 1041 children and adolescents in a small and medium-sized cities. All of the participants were evaluated in terms of their demographic characteristics and present use of the internet and smartphone, as well as using internet and smartphone addiction and other psychological scales. Statistical analyses were performed to compare the psychosocial factors between the high risk, potential risk, and general user groups of internet and smartphone addiction. Results: The participants were classified into three groups, the high risk (N=33), potential risk (N=203), and general user (N=805) groups with regard to their internet and smartphone addiction level. There were statistical significantly differences between the groups in terms of the economic status of the family, academic performance, parents, use of internet and smartphone, loneliness, family cohesion, family adaptability, perceived social support, and peer relationship. Conclusion: These results suggest that the internet and smartphone addiction of children and adolescents is related to various psychosocial vulnerability factors.

A Study on the Determinants of Perceived Social Usefulness and Continuous Use Intention of the Internet of things in the Public Sector (공공부문 사물인터넷의 지각된 사회적 유용성 및 지속사용의도 향상을 위한 결정요인에 관한 연구)

  • Yoon, Seong-Jeong;Kim, Min-Yong
    • Management & Information Systems Review
    • /
    • v.36 no.1
    • /
    • pp.115-141
    • /
    • 2017
  • This study is to find the key factors of the Internet of Things for development in public sector. In previous studies, it is said that Internet of Things can work digital system without human operation and gives a lot of outputs(information) users. Generally, people are a subject of operating digital system in traditional way, while people are an object on the internet of things. In other words, it is possible to work digital system with only networking from things to things. After all, it is reported that these advantages of the Internet of Things make possible to reduce social costs significantly in public sector. However, despite the strengths of the Internet of Things, there is a specific user acceptance of the technology factor for the Internet of Things rarely. It means that developing of the Internet of Things only focuses on the final purpose. If the focus on development meet this purpose, the user is ignored for the specific reason that using a technique. As a result of this, many users gradually decrease the continuous using of the Internet of Things. Thus, in this study, we need to find what critical factors should reflect to the Internet of Things in public sector. To find this result, there is no choice to use Technology Acceptance Model(TAM). Many researchers have proved that Technology Acceptance Model is valid through the four process in model introduction, confirmation, expansion and refinement from 1986 to 2003. The results of this study showed that the result explanatory power of Internet of Things in public sector is the most important factor affecting only perceived social usefulness and ease of use. Finally, it can be seen that the user has a positive attitude toward use, which has a positive effect on the intention to use continuously. The implications of this study are summarized as follows: When the public Internet of Things service is provided, it means that the user can easily understand the result, and when the person and the object communicate the result to each other, they should be able to communicate with each other. This means that a lot of user effort is needed to understand the outcome of the public Internet of Things being provided.

  • PDF

Social Network Based Music Recommendation System (소셜네트워크 기반 음악 추천시스템)

  • Park, Taesoo;Jeong, Ok-Ran
    • Journal of Internet Computing and Services
    • /
    • v.16 no.6
    • /
    • pp.133-141
    • /
    • 2015
  • Mass multimedia contents are shared through various social media servies including social network service. As social network reveals user's current situation and interest, highly satisfactory personalized recommendation can be made when such features are applied to the recommendation system. In addition, classifying the music by emotion and using analyzed information about user's recent emotion or current situation by analyzing user's social network, it will be useful upon recommending music to the user. In this paper, we propose a music recommendation method that makes an emotion model to classify the music, classifies the music according to the emotion model, and extracts user's current emotional state represented on the social network to recommend music, and evaluates the validity of our method through experiments.

A Multimedia Recommender System Using User Playback Time (사용자의 재생 시간을 이용한 멀티미디어 추천 시스템)

  • Kwon, Hyeong-Joon;Chung, Dong-Keun;Hong, Kwang-Seok
    • Journal of Internet Computing and Services
    • /
    • v.10 no.1
    • /
    • pp.111-121
    • /
    • 2009
  • In this paper, we propose a multimedia recommender system using user's playback time. Proposed system collects multimedia content which is requested by user and its user‘s playback time, as web log data. The system predicts playback time.based preference level and related contents from collected transaction database by fuzzy association rule mining. Proposed method has a merit which sorts recommendation list according to preference without user’s custom preference data, and prevents a false preference. As an experimental result, we confirm that proposed system discovers useful rules and applies them to recommender system from a transaction which doesn‘t include custom preferences.

  • PDF

Cell Virtualization with Network Partition for Initial User Association in Software Defined Small-cell Networks

  • Sun, Guolin;Lu, Li;Ayepah-Mensah, Daniel;Fang, Xiufen;Jiang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4703-4723
    • /
    • 2018
  • In recent years, dense small cell network has been deployed to address the challenge that has resulted from the unprecendented growth of mobile data traffic and users. It has proven to be a cost efficeient solution to offload traffic from macro-cells. Software defined heterogeneous wireless network can decouple the control plane from the data plane. The control signal goes through the macro-cell while the data traffic can be offloaded by small cells. In this paper, we propose a framework for cell virtualization and user association in order to satisfy versatile requirements of multiple tenants. In the proposed framework, we propose an interference graph partioning based virtual-cell association and customized physical-cell association for multi-homed users in a software defined small cell network. The proposed user association scheme includes 3 steps: initialization, virtual-cell association and physical-cell association. Simulation results show that the proposed virtual-cell association outperforms the other schemes. For physical-cell association, the results on resource utilization and user fairness are examined for mobile users and infrastructure providers.

A Simplified Zero-Forcing Receiver for Multi-User Uplink Systems Based on CB-OSFB Modulation

  • Bian, Xin;Tian, Jinfeng;Wang, Hong;Li, Mingqi;Song, Rongfang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.5
    • /
    • pp.2275-2293
    • /
    • 2020
  • This paper focuses on the simplified receiver design for multi-user circular block oversampled filter bank (CB-OSFB) uplink systems. Through application of discrete Fourier transform (DFT), the special banded structure and circular properties of the modulation matrix in the frequency domain of each user are derived. By exploiting the newly derived properties, a simplified zero-forcing (ZF) receiver is proposed for multi-user CB-OSFB uplink systems in the multipath channels. In the proposed receiver, the matrix inversion operation of the large dimension multi-user equivalent channel matrix is transformed into DFTs and smaller size matrix inversion operations. Simulation is given to show that the proposed ZF receiver can dramatically reduce the computational complexity while with almost the same symbol error rate as that of the traditional ZF receiver.

Social-Aware Collaborative Caching Based on User Preferences for D2D Content Sharing

  • Zhang, Can;Wu, Dan;Ao, Liang;Wang, Meng;Cai, Yueming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.3
    • /
    • pp.1065-1085
    • /
    • 2020
  • With rapid growth of content demands, device-to-device (D2D) content sharing is exploited to effectively improve the service quality of users. Considering the limited storage space and various content demands of users, caching schemes are significant. However, most of them ignore the influence of the asynchronous content reuse and the selfishness of users. In this work, the user preferences are defined by exploiting the user-oriented content popularity and the current caching situation, and further, we propose the social-aware rate, which comprehensively reflects the achievable contents download rate affected by the social ties, the caching indicators, and the user preferences. Guided by this, we model the collaborative caching problem by making a trade-off between the redundancy of caching contents and the cache hit ratio, with the goal of maximizing the sum of social-aware rate over the constraint of limited storage space. Due to its intractability, it is computationally reduced to the maximization of a monotone submodular function, subject to a matroid constraint. Subsequently, two social-aware collaborative caching algorithms are designed by leveraging the standard and continuous greedy algorithms respectively, which are proved to achieve different approximation ratios in unequal polynomial-time. We present the simulation results to illustrate the performance of our schemes.

Joint Subcarrier and Bit Allocation for Secondary User with Primary Users' Cooperation

  • Xu, Xiaorong;Yao, Yu-Dong;Hu, Sanqing;Yao, Yingbiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.12
    • /
    • pp.3037-3054
    • /
    • 2013
  • Interference between primary user (PU) and secondary user (SU) transceivers should be mitigated in order to implement underlay spectrum sharing in cognitive radio networks (CRN). Considering this scenario, an improved joint subcarrier and bit allocation scheme for cognitive user with primary users' cooperation (PU Coop) in CRN is proposed. In this scheme, the optimization problem is formulated to minimize the average interference power level at the PU receiver via PU Coop, which guarantees a higher primary signal to interference plus noise ratio (SINR) while maintaining the secondary user total rate constraint. The joint optimal scheme is separated into subcarrier allocation and bit assignment in each subcarrier via arith-metric geo-metric (AM-GM) inequality with asymptotical optimization solution. Moreover, the joint subcarrier and bit optimization scheme, which is evaluated by the available SU subcarriers and the allocated bits, is analyzed in the proposed PU Coop model. The performance of cognitive spectral efficiency and the average interference power level are investigated. Numerical analysis indicates that the SU's spectral efficiency increases significantly compared with the PU non-cooperation scenario. Moreover, the interference power level decreases dramatically for the proposed scheme compared with the traditional Hughes-Hartogs bit allocation scheme.

Improvement in Operation Efficiency for Chip Mounter Using Web Server

  • Lim, Sun-Jong;Joon Lyou
    • International Journal of Precision Engineering and Manufacturing
    • /
    • v.4 no.6
    • /
    • pp.5-11
    • /
    • 2003
  • The number of the enterprises which utilize network technology has been increasing for solving problems such as productivity improvement, market trend analysis, and material collection for making decision. Especially, the management of equipment and the recovery time reduction when machines break down are very important factors in productivity improvement of the enterprise. Currently, most of the remote trouble diagnosis of equipment using the internet have just one function of transmitting the trouble information to the user. Therefore it does not directly reflect the user's recovery experience or the developer's new recovery methods. If the user's experienced recovery methods or the developer's recovery methods as well as the basic recovery methods are reflected online or on the internet, it makes it possible to recover faster than before. In this paper, we develop a Remote Monitoring Server (RMS) for chip mounters, and make it possible to reduce the recovery time by reflecting the user's experience and developer's new methods in addition to presenting the basic recovery methods. For this, trouble recovery concept will be defined. Based on this, many functions(trouble diagnosis, the presentation of the basic recovery methods, user's and developer's recovery method, counting function of the trouble number of each code, and presentation of usage number of each recovery methods) were developed. By utilizing the reports of the actual results of chip mounter and the notice function of the parts change time, the rate of operation of the chip mounter can be improved.