Dissertations / Theses on the topic 'Social-based'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Social-based.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Rangiha, M. E. "A framework for social BPM based on social tagging." Thesis, City University London, 2016. http://openaccess.city.ac.uk/14999/.
Full textEliasson, Benitha. "Social Work Approaching Evidence-Based Practice. : Rethinking Social Work." Doctoral thesis, Luleå tekniska universitet, Arbetsvetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-18343.
Full textGodkänd; 2014; 20140731 (beneli); Nedanstående person kommer att disputera för avläggande av filosofie doktorsexamen. Namn: Benitha Eliasson Ämne: Arbetsvetenskap/Human Work Science Avhandling: Social Work Approaching Evidence-Based Practice Rethinking Social Work Opponent: Professor of Health Care Organisation Mike Dent, Faculty of Health Sciences, Staffordshire University, Storbritannien Ordförande: Professor Elisabeth Berg, Avd för arbetsvetenskap, Institutionen för ekonomi, teknik och samhälle, Luleå tekniska universitet Tid: Måndag den 29 september 2014, kl 13.00 Plats: A109, Luleå tekniska universitet
Tang, Hon Cheong 1980. "Gravity-based trust model for web-based social networks." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=112366.
Full textErlandsson, Fredrik. "On social interaction metrics : social network crawling based on interestingness." Licentiate thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-00596.
Full textAriyattu, Resmi. "Towards federated social infrastructures for plug-based decentralized social networks." Thesis, Rennes 1, 2017. http://www.theses.fr/2017REN1S031/document.
Full textIn this thesis, we address two issues in the area of decentralized distributed systems: network-aware overlays and collaborative editing. Even though network overlays have been extensively studied, most solutions either ignores the underlying physical network topology, or uses mechanisms that are specific to a given platform or applications. This is problematic, as the performance of an overlay network strongly depends on the way its logical topology exploits the underlying physical network. To address this problem, we propose Fluidify, a decentralized mechanism for deploying an overlay network on top of a physical infrastructure while maximizing network locality. Fluidify uses a dual strategy that exploits both the logical links of an overlay and the physical topology of its underlying network to progressively align one with the other. The resulting protocol is generic, efficient, scalable and can substantially improve network overheads and latency in overlay based systems. The second issue that we address focuses on collaborative editing platforms. Distributed collaborative editors allow several remote users to contribute concurrently to the same document. Only a limited number of concurrent users can be supported by the currently deployed editors. A number of peer-to-peer solutions have therefore been proposed to remove this limitation and allow a large number of users to work collaboratively. These decentralized solution assume however that all users are editing the same set of documents, which is unlikely to be the case. To open the path towards more flexible decentralized collaborative editors, we present Filament, a decentralized cohort-construction protocol adapted to the needs of large-scale collaborative editors. Filament eliminates the need for any intermediate DHT, and allows nodes editing the same document to find each other in a rapid, efficient and robust manner by generating an adaptive routing field around themselves. Filament's architecture hinges around a set of collaborating self-organizing overlays that utilizes the semantic relations between peers. The resulting protocol is efficient, scalable and provides beneficial load-balancing properties over the involved peers
Sairin, Sjafri. "Javanese trah : kin-based social organization /." Yogyakarta : Gadjah Mada university press, 1992. http://catalogue.bnf.fr/ark:/12148/cb374310288.
Full textBibliogr. p. 92-96.
Chambers, Cynthia R. "Creating Meaningful, Community-Based Social Networks." Digital Commons @ East Tennessee State University, 2014. https://dc.etsu.edu/etsu-works/3851.
Full textBAFFA, AUGUSTO CESAR ESPINDOLA. "STORYTELLING BASED ON AUDIENCE SOCIAL INTERACTION." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2015. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=25300@1.
Full textCONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
Ao contar uma história, o narrador usa toda sua habilidade para entreter a audiência. Esta tarefa não define apenas o ato de contar uma história, mas também a capacidade de compreender as reações do público durante a narração da história. Não é muito difícil adaptar uma história para um único individuo baseando-se em suas preferências e escolhas anteriores, porém, a tarefa de escolher o que é melhor para um grupo torna-se bastante complicada. A seleção por votação de uma maioria pode não ser eficiente pois descarta alternativas que foram consideradas secundárias por alguns indivíduos, mas que funcionariam melhor para o grupo em questão. Desta forma, a seleção descuidada dos eventos em uma história poderia causar a ruptura do grupo, fazendo com que algumas pessoas desistam de continuar assistindo pois não foram agradadas. Esta tese propõe uma metodologia para criar histórias adaptadas para a audiência com base em traços de personalidade e preferências de cada indivíduo. Como uma audiência pode ser composta de indivíduos com preferências semelhantes ou mistas, é necessário considerar uma solução de meio-termo com base nas opções individuais. Além disso, os indivíduos podem ter algum tipo de relação com os outros que influenciam suas decisões. O modelo proposto aborda todas as etapas da missão de agradar ao público. Deve inferir quais são as preferências, calcular a recompensa das cenas para todos os indivíduos, estimar as escolhas de forma independente e em grupo, e permitir sistemas de Storytelling Interativos encontrar a história que maximiza a recompensa esperada da audiência. O modelo proposto pode ser facilmente estendido a outras áreas que envolvem usuários interagindo com ambientes digitais.
To tell a story, the storyteller uses all his/her skills to entertain an audience. This task not only relies on the act of telling a story, but also on the ability to understand reactions of the audience during the telling of the story. It is not so difficult to adapt a story for a single individual based on his/her preferences and previous choices. However, the task of choosing what is best for a group becomes quite complicated. The selection by majority voting cannot be effective because it can discard alternatives that are secondary for some individuals, but that would work better for the group in question. Thus, the careless selection of events in a story could cause audience splitting, causing some people to give up keep watching because they were not pleased. This thesis proposes a new methodology to create tailored stories for an audience based on personality traits and preferences of each individual. As an audience may be composed of individuals with similar or mixed preferences, it is necessary to consider a middle ground solution based on the individual options. In addition, individuals may have some kind of relationship with others who influence their decisions. The proposed model addresses all steps in the quest to please the audience. It infers what the preferences are, computes the scenes reward for all individuals, estimates their choices independently and in group, and allows Interactive Storytelling systems to find the story that maximizes the expected audience reward. The proposed model can easily be extended to other areas that involve users interacting with digital environments.
Carslaw, Gregory. "Agent based modelling in social psychology." Thesis, University of Birmingham, 2013. http://etheses.bham.ac.uk//id/eprint/4068/.
Full textChatzilari, Elisavet. "Social media based scalable concept detection." Thesis, University of Surrey, 2014. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658829.
Full textLeung, Kwan Wai. "Commentary-based social media clustering with concept and social network discovery." HKBU Institutional Repository, 2011. https://repository.hkbu.edu.hk/etd_ra/1303.
Full textLai, Ka Chon. "Constructing social networks based on image analysis." Thesis, University of Macau, 2012. http://umaclib3.umac.mo/record=b2586279.
Full textLamborn, Peter C. "January : search based On social insect behavior /." Diss., CLICK HERE for online access, 2005. http://contentdm.lib.byu.edu/ETD/image/etd801.pdf.
Full textStewart, Denyse. "Social change and community-based literacy programs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0007/MQ40676.pdf.
Full textBrown, Holly Beth. "Social Justice and Community-Based Art Education." Thesis, The University of Arizona, 2010. http://hdl.handle.net/10150/193320.
Full textFan, Xiaoguang, and 樊晓光. "Study of social-network-based information propagation." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hub.hku.hk/bib/B50899600.
Full textpublished_or_final_version
Electrical and Electronic Engineering
Doctoral
Doctor of Philosophy
Khelghatdoust, Mansour. "Gossip based peer sampling in social overlays." Thesis, KTH, Kommunikationsnät, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-144278.
Full textWang, Guan. "Graph-Based Approach on Social Data Mining." Thesis, University of Illinois at Chicago, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3668648.
Full textPowered by big data infrastructures, social network platforms are gathering data on many aspects of our daily lives. The online social world is reflecting our physical world in an increasingly detailed way by collecting people's individual biographies and their various of relationships with other people. Although massive amount of social data has been gathered, an urgent challenge remain unsolved, which is to discover meaningful knowledge that can empower the social platforms to really understand their users from different perspectives.
Motivated by this trend, my research addresses the reasoning and mathematical modeling behind interesting phenomena on social networks. Proposing graph based data mining framework regarding to heterogeneous data sources is the major goal of my research. The algorithms, by design, utilize graph structure with heterogeneous link and node features to creatively represent social networks' basic structures and phenomena on top of them.
The graph based heterogeneous mining methodology is proved to be effective on a series of knowledge discovery topics, including network structure and macro social pattern mining such as magnet community detection (87), social influence propagation and social similarity mining (85), and spam detection (86). The future work is to consider dynamic relation on social data mining and how graph based approaches adapt from the new situations.
Laraqui, Jawad. "Activity based interfaces in online social networks." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/41658.
Full textIncludes bibliographical references (p. 51).
The goal of the project is to explore how activity-based interfaces can create more meaningful experiences for the users and builders of online social networking sites. Medina, a social-networking site based on the idea of exchanging knowledge, explores new interfaces for visualizing connections between people and ideas. The site constantly measures interactions between people and their interests in order to create a more accurate picture of what relationships and information are important.
by Jawad Laraqui.
M.Eng.
Karunatillake, Nishan C. "Argumentation-based negotiation in a social context." Thesis, University of Southampton, 2006. https://eprints.soton.ac.uk/263130/.
Full textSaleem, Muhammad. "Location Analytics for Location-Based Social Networks." Doctoral thesis, Universite Libre de Bruxelles, 2018. https://dipot.ulb.ac.be/dspace/bitstream/2013/271131/5/contratMS.pdf.
Full textDoctorat en Sciences de l'ingénieur et technologie
The portal is not showing my complete name. The name (my complete name), I want to have on the diploma is "Muhammad Aamir Saleem". Please correct this issue.
info:eu-repo/semantics/nonPublished
Bucci, Aleia. "Social entrepreneurs’ conceptions of incubator-based learning." Diss., University of Pretoria, 2020. http://hdl.handle.net/2263/79768.
Full textThesis (PhD)--University of Pretoria, 2020.
Gordon Institute of Business Science (GIBS)
DPhil
Unrestricted
Baicu, Mihai-Catalin. "Social Sustainability in EU-Based Urban Regeneration." Thesis, Malmö universitet, Malmö högskola, Institutionen för Urbana Studier (US), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-43203.
Full textHudson, Matthew. "Social presence in team-based digital games." Thesis, University of York, 2014. http://etheses.whiterose.ac.uk/9109/.
Full textLloyd, Kirsten Ruth. "Social documents : the mediation of social relations in lens-based contemporary art." Thesis, University of Edinburgh, 2017. http://hdl.handle.net/1842/25934.
Full textBerntsen, Gøran, and Bård Gamnes. "Social Entrepreneurship in 2011 : A framework for classifying ventures based on social efforts and social effects." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for industriell økonomi og teknologiledelse, 2011. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-15064.
Full textAlahmadi, Dimah. "Recommender systems based on online social networks : an Implicit Social Trust And Sentiment analysis approach." Thesis, University of Manchester, 2017. https://www.research.manchester.ac.uk/portal/en/theses/recommender-systems-based-on-online-social-networks-an-implicit-social-trust-and-sentiment-analysis-approach(ac03f7e5-4fc0-4c4a-bace-82188823eb84).html.
Full textMthombeni, Sithembile. "Motivating factors of social entrepreneurs : the experiences of social entrepreneurs based in Gauteng." Diss., University of Pretoria, 2015. http://hdl.handle.net/2263/52265.
Full textMini Dissertation (MBA)--University of Pretoria, 2015.
pa2016
Gordon Institute of Business Science (GIBS)
MBA
Unrestricted
Gao, Fei. "Structure based online social network link prediction study." Thesis, King's College London (University of London), 2017. https://kclpure.kcl.ac.uk/portal/en/theses/structure-based-online-social-network-link-prediction-study(41697041-bfe4-4e64-a516-1a0703cfb4bb).html.
Full textWeiand, Klara. "Keyword-Based Querying for the Social Semantic Web." Diss., lmu, 2011. http://nbn-resolving.de/urn:nbn:de:bvb:19-126719.
Full textMuthmann, Klemens. "Topic-Based Aggregation of Questions in Social Media." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-125989.
Full textLim, Choi Keung Sarah Niukyun. "Trust-based social mechanism to counter deceptive behaviour." Thesis, University of Warwick, 2011. http://wrap.warwick.ac.uk/38163/.
Full textRawashdeh, Majdi. "Towards Folksonomy-based Personalized Services in Social Media." Thèse, Université d'Ottawa / University of Ottawa, 2014. http://hdl.handle.net/10393/30985.
Full textJones, Simon. "Automating group-based privacy control in social networks." Thesis, University of Bath, 2012. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.629649.
Full textCaeyers, Bet Helena. "Social networks, community-based development and empirical methodologies." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:61dbdd9e-9341-4959-a6ca-15547720df3c.
Full textWangchuk, Tshering. "Community-based Influence Maximization framework for Social Networks." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-15378.
Full textRebaza, Jorge Carlos Valverde. "Mining user behavior in location-based social networks." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-16112017-085356/.
Full textRedes sociais online (OSNs) são plataformas Web que oferecem serviços para promoção da interação social entre usuários. OSNs que adicionam serviços relacionados à geolocalização são chamadas redes sociais baseadas em localização (LBSNs). Um dos maiores desafios na análise de LBSNs é a predição de links. A predição de links refere-se ao problema de estimar a probabilidade de conexão futura entre pares de usuários que não se conhecem. Grande parte das pesquisas que focam nesse problema exploram o uso, de maneira isolada, de informações sociais (e.g. amigos em comum) ou de localização (e.g. locais comuns visitados). Porém, algumas pesquisas mostraram que a combinação de diferentes fontes de informação pode influenciar o incremento da acurácia da predição. Motivado por essa lacuna, neste trabalho foram desenvolvidos diferentes métodos para predição de links combinando diferentes fontes de informação. Assim, propomos sete métodos que usam a informação relacionada à participação simultânea de usuários en múltiples grupos sociais: common neighbors within and outside of common groups (WOCG), common neighbors of groups (CNG), common neighbors with total and partial overlapping of groups (TPOG), group naïve Bayes (GNB), group naïve Bayes of common neighbors (GNB-CN), group naïve Bayes of Adamic-Adar (GNB-AA), e group naïve Bayes of Resource Allocation (GNB-RA). Devido ao fato que a presença de grupos sociais não está restrita a alguns tipo de redes, essas propostas podem ser usadas nas diversas OSNs existentes, incluindo LBSNs. Também, propomos oito métodos que combinam o uso de informações sociais e de localização: Check-in Observation (ChO), Check-in Allocation (ChA), Within and Outside of Common Places (WOCP), Common Neighbors of Places (CNP), Total and Partial Overlapping of Places (TPOP), Friend Allocation Within Common Places (FAW), Common Neighbors of Nearby Places (CNNP), e Nearby Distance Allocation (NDA). Tais propostas são para uso exclusivo em LBSNs. Os resultados obtidos indicam que nossas propostas são tão competitivas quanto métodos do estado da arte, podendo até superá-los em determinados cenários. Ainda mais, devido a que na maioria dos casos nossas propostas são computacionalmente mais eficientes, seu uso resulta mais adequado em aplicações do mundo real.
Bohn, Angela, Ingo Feinerer, Kurt Hornik, and Patrick Mair. "Content-Based Social Network Analysis of Mailing Lists." The R Foundation for Statistical Computing, 2011. http://epub.wu.ac.at/5435/1/RJournal_2011%2D1_Bohn~et~al.pdf.
Full textLi, Yafei. "Efficient group queries in location-based social networks." HKBU Institutional Repository, 2015. https://repository.hkbu.edu.hk/etd_oa/203.
Full textHenry, Nathalie. "Exploring large social networks with matrix-based representations." Paris 11, 2008. http://www.theses.fr/2008PA112237.
Full textWith the increasing use of Internet technologies, social scientists have more data to analyze. Online communities such as Facebook or Flickr provide rich information on how people communicate and how their social network evolves. To analyze this data, social scientists require robust tools that can handle large and complex networks and allow a flexible analysis from overviews of the entire dataset to detailed analysis of important sections. As human brain is particularly effective at processing visual information, we propose to support the exploration of social networks by information visualization. Previous tools for network visualization are mostly based on node-link diagrams, suffering of readability issues (node overlapping or edge crossing) for either large or dense networks. In this thesis, we investigate alternative representations based on adjacency matrices. Following participatory design principles, we involved social scientists into the design of three interactive visual systems: MatrixExplorer, MatLink and NodeTrix. MatrixExplorer combines matrices and node-link diagrams. Both representations are coordinated and a set of interactive tools allows their manipulation. MatLink is an augmented matrix, providing interactive links on its border to help performing some connectivity tasks. Finally, NodeTrix represents networks as node-link diagrams, using matrices for dense sub-parts. NodeTrix is particularly suited for small-world networks, globally sparse but locally dense. This dissertation presents the design and evaluation of these three systems including a case study analyzing 20 years of publications data in Human-Computer Interaction
St, Amand Santos Monica. "Generalization of Social Skills Based on Instructional Setting." ScholarWorks, 2018. https://scholarworks.waldenu.edu/dissertations/6129.
Full textCordeiro, João Miguel Magalhães Marcelino Fernandes. "Sound based social networks." Doctoral thesis, 2013. http://hdl.handle.net/10400.14/15773.
Full textO ambiente sonoro de um lugar é um eco da sua atividade e carácter, transportando, na maior parte da vezes, informação adicional àquela que é proporcionada à visão (quer seja redundante ou complementar). É, portanto, uma impressão digital acústica - tangível e volátil - do lugar a que pertence, ou simplesmente uma fotografia acústica de um evento pontual. A este opulento recurso, carregado de significados e subtilezas, Schafer chamou de Paisagem-Sonora. O projeto de investigação de carácter exploratório que aqui apresentamos visa o estudo da Paisagem-Sonora no contexto das Redes Sociais Móveis Em-Linha, procurando entender os moldes e limites da sua aplicação, tendo em vista o estabelecimento e/ou reforço de novos ou existente laços sociais, respectivamente. Para satisfazer este objectivo foi necessária uma abordagem multidisciplinar, ancorada em três pilares principais: a Paisagem-Sonora, o Som Móvel e as Redes Sociais. Estas três áreas determinaram a moldura científica de referência em que se enquadrou esta investigação, sendo explanadas na primeira parte da tese. Um extenso levantamento do estado-da-arte referente a projetos relacionados com este estudo é também apresentado, compilando exemplos de áreas distintas mas adjacentes, tais como: Computação Sensorial Móvel, Computação Vestível, Sonificação, Média Social e Computação Contexto-Dependente. Este levantamento veio confirmar quer a originalidade quer a pertinência científica do projeto apresentado. Posteriormente, a fim de avaliar o papel da Paisagem-Sonora no contexto das Redes Sociais, foi posto em prática um procedimento experimental baseado numa Rede Social Sonora Em-Linha, desenvolvida de raiz para dispositivos móveis e acrescida de mecanismos sensoriais para estímulos ambientais, capazes de analisar a Paisagem-Sonora envolvente e os movimentos do utilizador. Dois objectivos principais guiaram a produção desta ferramenta de investigação: recolher dados relativos à atividade cinética e sonora dos utilizadores e proporcionar a estes uma experiência real de utilização uma Rede Social Sonora, de modo a recolher opiniões fundamentadas sobre esta tipologia específica de socialização. A aplicação – Hurly-Burly – analisa a Paisagem-Sonora através de algoritmos de Audição Computacional, classificando- a de acordo com quatro categorias: diálogo (voz), música, sons ambientais (“ruídos”) e silêncio. Adicionalmente, determina o seu nível de pressão sonora em dB(A)eq. Esta informação é então distribuída pela rede social dos utilizadores, permitindo a cada elemento visualizar e ouvir uma representação do som analisado. É mantido num servidor Web um registo individual da informação sonora e cinética captada, o qual pode ser acedido através de uma aplicação Web que mostra o perfil sonoro de cada utilizador ao longo do tempo, numa visualização ao estilo linha-temporal. O procedimento experimental incluiu três grupos de teste distintos, formando cada um a sua própria rede social com coeficiente de aglomeração igual a um. Após a implementação da experiência e análise de resultados, concluímos que a Paisagem- Sonora pode desempenhar um papel no paradigma das Redes Sociais Em- Linha, em particular no que diz respeito à sua presença nos dispositivos móveis. Ficou provado que os dispositivos móveis comerciais da atualidade apresentam-se com uma oportunidade promissora para desempenhar este tipo de tarefas (tais como: monitorização contínua, registo quotidiano e análise sensorial ambiental), mas as limitações relacionadas com a autonomia energética e funcionamento em multitarefa representam ainda um constrangimento que impede a sua massificação. Além disso, a privacidade no mundo virtual é algo que os utilizadores atuais não estão dispostos a abdicar: partilhar continuamente a Paisagem-Sonora real em detrimento de uma representação de alto nível é algo que refrearia os utilizadores de usar a aplicação. Também demonstrámos que os utilizadores que mais conhecedores do fenómeno da Paisagem-Sonora são também os que consideram esta como importante no contexto das Redes Sociais Em-Linha. Isso significa que uma atitude pedagógica em relação ao fenómeno sonoro é essencial para obter dele o maior ganho possível. Esta investigação propõe-se a dar um passo em frente nessa direção.
Wen, Yu-Ting, and 溫郁婷. "Exploring social influence on location-based social networks." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/99336810230166308365.
Full text國立交通大學
資訊科學與工程研究所
102
Recently, with the advent of location-based social networking services (LBSNs), e.g., Foursquare, Yelp, Geolife and Flickr, travel planing and location-aware information recommendation based on LBSN have attracted research attentions, such as Point-of-interest (POI) recommendation or travel routes recommendation. Most of the existing works mainly address on mining POIs by crowd power in LBSN and generate the recommendation on demand. For example, extracting personal preferences from individual’s location history to score the POIs in query region. However, they ignore the impact of social relations hidden in LBSN, i.e., the social influence from friends. We suppose that the location-aware recommendation with favorable comments from friends should be more reliable than that from unfamiliar crowd.In this paper, we propose a new social influence-based user recommender framework (SIR) which differs from prior works by aiming to discover the potential value addition from reliable users (i.e. close friends and travel experts). Explicitly, our SIR framework is able to infer influential users from LBSN. We claim to capture the interaction among virtual community, physical mobility activities and time effects to infer the social influence between user pairs. Furthetmore, we intend to model the propagation of influence in terms of diffusion-based mechanism. Third, we design a dynamic fusion framework to integrate the features mined into an united follow probability score. Finally, our framework provides personalized top-k user recommendation for individuals. To evaluate the recommendation results, we conduct extensive experiments on real datasets (i.e., Flicker dataset and Gowalla datasets). The experimental results shows the performance of our SIR framework is better than a state-of-the-art user recommendation mechanisms in terms of accuracy and reliability.
Cheng, Song-Fen, and 鄭松棻. "Recommended based on Social Behavior." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/03451460854176891878.
Full text淡江大學
資訊工程學系碩士在職專班
98
Pushed by the increasing advancement of computer technology and the rapid growth of the Internet, digital information has been produced on a mass scale. Internet network has become a huge information source and provided rich and valuable resource. Every Web site is like a data source, and these sources can be seen as a database in general sense, even large and more complex than the database in conventional sense. Via website links, these Web sites with different contents and organizations constitute a large heterogeneous database environment. Without the help of efficient search engines, finding the wanted information from the current World Wide Web will be as difficult as looking for a needle in the haystack. Today there are many commercial search engines to meet such needs, for instance: Google, Yahoo, Ask and Microsoft Live Search, and so on. Search engines usually will rate and list the searched results according to their relevancy for users to browse and choose the summary contents of the searched results. Such a browsing mode is extremely inefficient, since the quantity of web search results is usually quite huge and most general users only browse a number of searched results listed in the beginning. Besides, this kind of rating and listing would make a lot of sub-topics searched mixed up with the wanted ones. This also tends to cause users to miss important information. In addition, in the process of retrieval, many users usually do not keep conducting keyword searches but instead spending more time browsing the searched results. However, a major problem is that the search engines using the search mechanism of web contents and hyperlink mode can only reflect web authors’ views but not readers’. In this paper, we based on users’ browsing web contents to develop web user clustering mining technology. And according to our experimental results, users can classify the web contents (of the websites browsed by them) and apply those contents to the web recommendation through the websites browsed by them.
JHENG, KAI-JHONG, and 鄭凱中. "A Beacon-Based Social System." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/96zyk6.
Full text國立中正大學
資訊工程研究所
106
In recent years, the social network and social software have grown substantially. The Weibo, twitter, Facebook, Line, and We Chat provides more service that makes information exchange between people more convenient. There were much social software on the network and the threshold of registering accounts is getting lower that making many fake accounts and the proliferation of pornographic advertising, in addition, it may cause problems, such as Internet fraud, personal safety and erotic trap, in fact, some people had suffered because they make wrong friends on the network. Therefore, with such diverse social networks and social software in the community, making friends is an important issue that must be given due attention. The goal of this study is to establish a regional social system that is immediacy and regional, and removes the shortcomings associated with pairing to create an excellent social environment. The environment of the system is built on the mobile application and incorporates a beacon. With this system, the user information is pushed to this range when the user is in the beacon push range, the system will perform user pairing through similarity algorithm that range can be adjusted according to the square meters. In addition, we also use the miniature positioning technology to locate the paired successful users and allow users to meet. Here we propose a regional social system that has immediacy and regional features that enhance user experience and ensure user safety. The system can be set in general indoor, can also be set in public places, such as parks, train station, plaza.
Chuang, Ching-hao, and 莊清皓. "Community Detection - Based on Social Interactions in Social Network." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/27471568342387395387.
Full text國立中央大學
資訊管理研究所
100
There has been much recent research about identifying communities in networks. Based on the online social network, which is getting more and more popular recently, we explore the community detection problem, i.e., how to identify the hidden sub-groups in the heterogeneous social network. Traditional research on community detection usually assumed that the structural information of the network is fully known, which is not feasible for many practical networks. Moreover, most previous algorithms for community detection did not differentiate multiple relations existing among objects or persons in a real world. In Facebook, two persons can be either friend or not friend. But in reality a friend relation may come from different reasons and belong to different social groups. Thus, how to differentiate different relations among users on Facebook is a key research issue in our work. In this paper, we propose a new approach utilizing the social interaction data, rather than structural information of the network, to address the community detection problem in Facebook. Specifically, we develop a method to find the multiple social groups of a Facebook user from his/her past interaction data with friends. The advantages of our approach include: i) it does not depend on the structural information, ii) it can differentiate different relations existing among friends, iii) it allows a friend belonging to multiple communities at the same time. In the experiment, we retrieve 10 Facebook user’s data as our datasets and evaluate the performance of each dataset. The results show that our method can identify the hidden social groups of users successfully from the interaction data in Facebook. Experimental results verify the feasibility and effectiveness of our approach.
Gramling, Jennifer Lynn. "Students' experiences of the social environment and social presence in campus-based and web-based education." 2003. http://etd.utk.edu/2003/GramlingJennifer.pdf.
Full textTitle from title page screen (viewed Sept. 24, 2003). Thesis advisor: John R. Ray. Document formatted into pages (ix, 129 p. : ill. (some col.)). Vita. Includes bibliographical references (p. 95-107).
Tung, Kuan Chieh, and 童冠傑. "Predicting Elections Based on Social Media." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/04571503441843228679.
Full text國立清華大學
資訊系統與應用研究所
103
Election prediction has been studied in the recent years. However, the previous works focus on counting the number of tweets mentioning candidates to predict the election result. Many reasons cause candidates to win or lose in an election, such as political opinions, social issues, scandals and other reasons. In this paper, we consider a novel viewpoint to predict election results. For a candidate, if the following event sequence happened, “(big event, positive) → (small event, negative) → (big event, positive)”, this candidate will win the election. We consider four approaches to generate the above sequences and then apply the rule-based classifier for predict the election results. A series of experiments are performed to evaluate our approaches and the experiment results reveal that the accuracy of our approaches on predicting election results is over 80% in most of the cases.
Yang, Fu-Chen, and 楊富丞. "Topic-Based Affective Social Media Mining." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/90141990220851072356.
Full text國立臺灣大學
資訊管理學研究所
104
Online social networks expedite social interactions where people create, share or exchange information and ideas. The contents generated by users in a social network usually contain a large volume of user opinions and feelings. They can be used as an effective vehicle to analyze product preferences, business strategies, marketing campaigns, social events, political movements, and healthcare experiences. Therefore, in this dissertation, we propose three LDA-based methods, called MPM (Mining Perceptual Maps), MAE (Mining Arousing Events) and MSS (Mining Social Support), to mine affective social media in social networks. The MPM method automatically builds perceptual maps and radar charts from consumer reviews based on users’ sentiment polarities toward different product features. Mining perceptual maps and radar charts can help companies gain knowledge of their and competitors’ products. The MAE method extracts emotionally arousing events from a collection of news documents based on readers’ emotions and intensities, where every news document contains a news article and some readers’ comments. Mining emotionally arousing events may provide a quick reference for politicians and a new aspect for hot news recommendation for readers. The MSS method mines social support and users’ emotion transitions from online healthcare social media. Mining social support by considering emotion transitions may help us better understand patients’ needs, attitudes and opinions, and provide more appropriate assistance since the changes of emotions often coincide with the changes of attitudes. Experimental results show that the MPM method can find the strengths and weaknesses of various mobile phones of different brands and different levels of prices from consumer reviews. The MAE method can better predict the readers’ emotions and intensities for unseen news articles, and discover better-quality and more subtle events using intensity. The MSS method shows that people with different diseases may express very different negative emotion transitions, and need various types of social support.
Chiu, Wen-Kuan, and 邱文寬. "Social Network Based Tourist Recommendation System." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/43421837965886354843.
Full text國立臺灣師範大學
資訊工程學系
102
Facebook is the most influential community platform in the world; according to the statistics officially released by Facebook, up to the third quarter of 2013, the number of active users has reached 1,190 millions. With the growth of users, Facebook has become a producer of Big data, and the vast amount of status updates posted by users, which conceal all kinds of useful information, have triggered many research projects focus on Facebook parameters such as the like count, the group count, etc. This research is based on Facebook communities. Through the analyses of the SCAN clustering algorithm, the users would be able to understand the relationships and connections between their mutual friends as stated in the results of grouping. Besides, the results of grouping have combined the Big Five personality model. By means of Facebook parameters, users can easily find out the personality traits of their friends. In this research, FQL was adopted to obtain the information of users themselves and friends around them for further analyses. When the number of friends is increasing, the SCAN clustering algorithm can improve the efficiency when it comes to grouping manually on Facebook. Lastly, this system has developed an integration with tourist information for the purpose of backpacking, so suitable travel companions will be recommended according to users' travel itineraries..