Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 10 of 10 for “"Webgraph"”.

  1. Monitoring internet censorship; linguistic connectivity within the webgraph

    <p>This work offers a significant contribution to the ongoing endeavours in monitoring the effects of internet censorship. It can be freely accessed online by anyone who lives in a censorship free society where limitations on academic texts are not in effect. However, there are numerous places …

    oxford Repository record for Monitoring internet censorship; linguistic connectivity within the webgraph (opens in a new tab)

  2. Webpage rank using Bayes' rule and connected components

    … the power iteration process applied on the huge webgraph of WWW, which involves approximately 50 billion webpages. In this thesis a novel method named CCRank is proposed. The CCRank first decomposes the webgraph into mutually disconnected sub-webgraphs, each called a connected component (CC) or …

    missouri Repository record for Webpage rank using Bayes' rule and connected components (opens in a new tab)

  3. VersionsRank : escores de reputação de páginas web baseados na detecção de versões

    Os motores de busca utilizam o WebGraph formado pelas páginas e seus links para atribuir reputação às páginas Web. Essa reputação é utilizada para montar o ranking de resultados retornados ao usuário. No entanto, novas versões de páginas com uma boa reputação acabam por distribuir os votos de …

    brazil-ufrgs Repository record for VersionsRank : escores de reputação de páginas web baseados na detecção de versões (opens in a new tab)

  4. Learning to rank in supervised and unsupervised settings using convexity and monotonicity

    … class of countermeasures "de-spam" the corrupted webgraph by removing abusive pages identified by supervised learning. Since exhaustive detection and neutralization is infeasible, there is a need for ranking functions that can, on one hand, attenuate the effects of link-spam without supervision …

    texas Repository record for Learning to rank in supervised and unsupervised settings using convexity and monotonicity (opens in a new tab)

  5. Graph-XLL: a graph library for extra large graph analytics on a single machine

    … Graph-XLL: a graph library implemented using the WebGraph framework in a vertex-centric manner, with much less memory requirement compared to igraph and NetworkX. Scalable analytics for extra large graphs (up to tens of millions of vertices and billions of edges) can be achieved on a single …

    uvic Repository record for Graph-XLL: a graph library for extra large graph analytics on a single machine (opens in a new tab)

  6. Identifying Search Engine Spam Using DNS

    … addresses. Heterogenous graphs derived from the webgraph of IRLbot are used to achieve this. PLD Supporters (PSUPP) which is the number of level-2 PLD supporters for each host on the host-host-PLD graph is the first algorithm that is studied. This is further improved by True PLD Supporters(TSUPP) …

    tamu Repository record for Identifying Search Engine Spam Using DNS (opens in a new tab)

  7. Web crawling, analysis and archiving

    … Web crawling using near-duplicatedetection and webgraph cycle detection, resolving also the problem of web spider traps.Following, we suggest that different types of websites demand different Web archiving approaches. We focus on social media and more specifically on weblogs. We introduce …

    greece Repository record for Web crawling, analysis and archiving (opens in a new tab)

  8. Compressing and Performing Algorithms on Massively Large Networks

    … results against a similar technique using the Webgraph Framework, and we see that not only are our base query speeds faster, but we also gain a more significant speed-up from reusing products. Then, we use our time-evolving compression to solve the earliest arrival paths problem and …

    oklahoma-thes Repository record for Compressing and Performing Algorithms on Massively Large Networks (opens in a new tab) Restricted access

  9. Memory-Constrained Computing

    … extension of any existing technique known as the WebGraph Framework. Our results show that for well intervalized graphs, like web graphs, the semi-compact is superior to all other data structures in terms of memory and access time. Furthermore, we show that in terms of memory, the compact data …

    umn Repository record for Memory-Constrained Computing (opens in a new tab)