BibSonomy publications for /user/mstrohm/networksThu Jun 23 23:07:21 CEST 2011Sybil-resilient online content rating2009PRELIMINARY-BIBTEX networks social-factors web-science Sat Nov 13 16:46:11 CET 2010Engineering societies in the agents world1--18{Engineering social order}2000MUSTREAD agents networks social Wed Nov 10 10:20:34 CET 2010science59961194{The Spread of Behavior in an Online Social Network Experiment}3292010MUSTREAD behavior networks social Sat Oct 30 11:59:24 CEST 2010Naturecite arxiv:0709.0303 Navigability of Complex Networks2007MUSTREAD networks theory Routing information through networks is a universal phenomenon in both natural and manmade complex systems. When each node has full knowledge of the global network connectivity, finding short communication paths is merely a matter of distributed computation. However, in many real networks nodes communicate efficiently even without such global intelligence. Here we show that the peculiar structural characteristics of many complex networks support efficient communication without global knowledge. We also describe a general mechanism that explains this connection between network structure and function. This mechanism relies on the presence of a metric space hidden behind an observable network. Our findings suggest that real networks in nature have underlying metric spaces that remain undiscovered. Their discovery would have practical applications ranging from routing in the Internet and searching social networks, to studying information flows in neural, gene regulatory networks, or signaling pathways. Fri Jun 25 12:09:08 CEST 2010{Networks, Crowds, and Markets: Reasoning About a Highly Connected World}2010algorithms books networks Mon Apr 19 19:11:25 CEST 2010Proc. of the Semantic Search 2010 Workshop (SemSearch2010)aprilThe Wisdom in Tweetonomies: Acquiring Latent Conceptual Structures from Social Awareness Streams2010folksonomy myown networks social tagging twitter taggingsurvey Wed Jul 01 09:26:27 CEST 2009New York, NY, USASIGIR '05: Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval130--137SimFusion: measuring similarity using unified relationship matrix2005MUSTREAD folksonomy networks reading-group search tagging tools In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data objects (e.g., web pages, queries) and their interrelationships (e.g., hyperlinks, user click-through sequences). We claim that iterative computations over the URM can help overcome the data sparseness problem and detect latent relationships among heterogeneous data objects, thus, can improve the quality of information applications that require com- bination of information from heterogeneous sources. To support our claim, we present a unified similarity-calculating algorithm, SimFusion. By iteratively computing over the URM, SimFusion can effectively integrate relationships from heterogeneous sources when measuring the similarity of two data objects. Experiments based on a web search engine query log and a web page collection demonstrate that SimFusion can improve similarity measurement of web objects over both traditional content based algorithms and the cutting edge SimRank algorithm.Wed Jul 01 09:24:01 CEST 2009New York, NY, USAHT '09: Proceedings of the Twentieth ACM Conference on Hypertext and HypermediaJulyHyperincident Connected Components of Tagging Networks2009TOREAD networks tagging Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of complex network analysis can be applied to examine their properties. One of the most basic tools, the analysis of connected components, however cannot be applied meaningfully: Tagging networks tend to be almost entirely connected. We therefore propose a generalization of connected components, m-hyperincident connected components. We show that decomposing tagging networks into 2-hyperincident connected components yields a characteristic component distribution with a salient giant component that can be found across various datasets. This pattern changes if the underlying formation process changes, for example, if the hypergraph is constructed from search logs, or if the tagging data is contaminated by spam: It turns out that the second- to 129th largest components of the spam-labeled Bibsonomy dataset are inhabited exclusively by spam users. Based on these findings, we propose and unsupervised method for spam detection. Fri Apr 17 11:53:00 CEST 2009Proc. 31st International Conference on Software Engineering, companion volumeMayTo appearUsing Formal Concept Analysis to Construct and Visualise Hierarchies of Socio-Technical Relations2009networks social-factors software-engineering myown Interest in the human aspects of software engineering has grown in the past years. For example, based on activity logs in software artefact repositories, researchers are recommending who should fix a bug for a certain component. However, existing work largely follows ad-hoc approaches to relate software artefacts to developers and rarely makes those socio-technical relations explicit in a single structure. In this paper we propose a novel application of formal concept analysis, in order to overcome those deficiencies. As a case study, we construct and visualise different views of the developers who fix and discuss bugs in the Eclipse project.Sat Mar 21 10:44:50 CET 2009ACM Computing Surveys (CSUR)1{Graph mining: Laws, generators, and algorithms}382006mathematics networks tools Fri Nov 28 21:31:26 CET 2008Los Alamitos, CA, USAInternational Workshop on Mining Software Repositories25Using Software Repositories to Investigate Socio-technical Congruence in Development Projects2007SEMINAL networks requirements-engineering We propose a quantitative measure of socio-technical congruence as an indicator of the performance of an organization in carrying out a software development project. We show how the information necessary to implement that measure can be mined from commonly used software repositories, and we describe how socio-technical congruence can be computed based on that information.Mon Sep 08 15:15:37 CEST 2008CLALecture Notes in Computer ScienceConcept Lattices and Their Applications49232008FCA networks theory Sun Sep 07 22:19:13 CEST 2008Workshop on Search in Social Media SSM'08, in conjunction with CIKM'08, Napa Valley, USAPurpose Tagging - Capturing User Intent to Assist Goal-Oriented Social Search2008commonsense folksonomy goals myown networks web-science taggingsurvey Tue Jul 29 13:38:17 CEST 2008Journal of Artificial Intelligence Research (JAIR)305-339Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis242005folksonomy graphs networks Mon Jul 21 15:36:30 CEST 2008Presented at the SIAM Conference on Discrete Mathematics Faster Algorithms for Constructing a Concept (Galois) Lattice2006TOREAD graphs networks In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also present two efficient variants of the algorithm, one for computing all concepts only, and one for constructing a frequent closed itemset lattice. The running time of our algorithms depends on the lattice structure and is faster than all other existing algorithms for these problems.Mon May 26 16:41:17 CEST 2008Proceedings of the Fourth International Workshop on Mining Software Repositories30Mining Eclipse Developer Contributions via Author-Topic Models2007datasets goals networks We present the results of applying statistical author-topic models to a subset of the Eclipse 3.0 source code consisting of 2,119 source files and 700,000 lines of code from 59 developers. This technique provides an intuitive and automated framework with which to mine developer contributions and competencies from a given code base while simultaneously extracting software function in the form of topics. In addition to serving as a convenient summary for program function and developer activities, our study shows that topic models provide a meaningful, effective, and statistical basis for developer similarity analysis.Wed May 21 12:39:46 CEST 2008AI Communications4245 - 262Network Properties of Folksonomies202007TOREAD networks reading-group web-science taggingsurvey Tue Apr 22 10:13:08 CEST 2008SIAM Review3569--581{The \$25,000,000,000 Eigenvector: The Linear Algebra behind Google}482006SNA networks search web-science Fri Apr 18 10:01:45 CEST 2008Physical Review E336104{Finding community structure in networks using the eigenvectors of matrices}742006MUSTREAD SNA networks Tue Apr 08 18:00:56 CEST 2008Arxiv preprint cond-mat/0611631{Basic Notions for the Analysis of Large Affiliation Networks/Bipartite Graphs}2006MUSTREAD SNA folksonomy networks