@inproceedings{ahn2007topological, title = {Analysis of topological characteristics of huge online social networking services}, address = {New York, NY, USA}, author = {Yong-Yeol Ahn and Seungyeop Han and Haewoon Kwak and Sue Moon and Hawoong Jeong}, booktitle = {Proceedings of the 16th international conference on World Wide Web}, pages = {835--844}, publisher = {ACM}, year = 2007, url = {http://portal.acm.org/citation.cfm?id=1242685}, location = {Banff, Alberta, Canada}, isbn = {978-1-59593-654-7}, doi = {http://doi.acm.org/10.1145/1242572.1242685}, description = {Analysis of topological characteristics of huge online social networking services}, biburl = {http://www.bibsonomy.org/bibtex/2441b644b330fec7951c274a502c26e58/jaeschke}, keywords = {analysis folksonomy network online social} } @article{jaeschke2008discovering, title = {Discovering Shared Conceptualizations in Folksonomies}, author = {Robert Jäschke and Andreas Hotho and Christoph Schmitz and Bernhard Ganter and Gerd Stumme}, booktitle = {Semantic Web and Web 2.0}, journal = {Web Semantics: Science, Services and Agents on the World Wide Web}, month = {feb}, number = 1, pages = {38--53}, volume = 6, year = 2008, url = {http://www.sciencedirect.com/science/article/B758F-4R53WD4-1/2/ae56bd6e7132074272ca2035be13781b}, description = {ScienceDirect - Web Semantics: Science, Services and Agents on the World Wide Web : Discovering shared conceptualizations in folksonomies}, abstract = {Social bookmarking tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualizations are not formalized, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples.}, biburl = {http://www.bibsonomy.org/bibtex/263901930c137df0c2dad84075c564b14/jaeschke}, keywords = {2008 analysis concept folksonomy for:nepomuk formal l3s myown tagging wp5} } @inproceedings{jaeschke2007analysis, title = {Analysis of the Publication Sharing Behaviour in {BibSonomy}}, address = {Berlin, Heidelberg}, author = {Robert Jäschke and Andreas Hotho and Christoph Schmitz and Gerd Stumme}, booktitle = {Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007)}, editor = {U. Priss and S. Polovina and R. Hill}, month = {July}, pages = {283--295}, publisher = {Springer-Verlag}, series = {Lecture Notes in Artificial Intelligence}, volume = 4604, year = 2007, isbn = {3-540-73680-8}, vgwort = {22}, abstract = {BibSonomy is a web-based social resource sharing system which allows users to organise and share bookmarks and publications in a collaborative manner. In this paper we present the system, followed by a description of the insights in the structure of its bibliographic data that we gained by applying techniques we developed in the area of Formal Concept Analysis.}, biburl = {http://www.bibsonomy.org/bibtex/20c2b212b9ea3d822bf4729fd5fe6b6e1/jaeschke}, keywords = {2007 analysis bibsonomy bookmarking fca folksonomy iccs l3s myown social trias} } @misc{candia-2007, title = {Uncovering individual and collective human dynamics from mobile phone records}, author = {J. Candia and M. C. Gonzalez and P. Wang and T. Schoenharl and G. Madey and A. L. Barabasi}, year = 2007, url = {http://www.citebase.org/abstract?id=oai:arXiv.org:0710.2939}, abstract = { Novel aspects of human dynamics and social interactions are investigated by means of mobile phone data. Using extensive phone records resolved in both time and space, we study the mean collective behavior at large scales and focus on the occurrence of anomalous events. We discuss how these spatiotemporal anomalies can be described using standard percolation theory tools. We also investigate patterns of calling activity at the individual level and show that the interevent time of consecutive calls is heavy-tailed. This finding, which has implications for dynamics of spreading phenomena in social networks, agrees with results previously reported on other human activities.}, biburl = {http://www.bibsonomy.org/bibtex/2ea8b6a4442ccc0cb7dd222f6bd1d992a/jaeschke}, keywords = {analysis dynamic mobile network phone sna social} } @inproceedings{Brandes07Role, title = {Role-equivalent Actors in Networks}, author = {Ulrik Brandes and Jürgen Lerner}, booktitle = {ICFCA 2007 Satellite Workshop on Social Network Analysis and Conceptual Structures: Exploring Opportunities}, editor = {Sergei Obiedkov and Camille Roth}, year = 2007, url = {http://www.inf.uni-konstanz.de/algo/publications/bl-rean-07.pdf}, abstract = {Abstract. Communities in social networks are often defined as groups of densely connected actors. However, members of the same dense group are not equal but may differ largely in their social position or in the role they play. Furthermore, the same positions can be found across the borders of dense communities so that networks contain a significant group structure which does not coincide with the structure of dense groups. This papers gives a survey over formalizations of network-positions with a special emphasis on the use of algebraic notions.}, biburl = {http://www.bibsonomy.org/bibtex/26ea541158f972b850e9ea330b473c7c4/jaeschke}, keywords = {actor analysis network role sna social structure} } @inproceedings{DBLP:conf/iccs/GanterR01, title = {Formal Concept Analysis Methods for Dynamic Conceptual Graphs.}, author = {Bernhard Ganter and Sebastian Rudolph}, booktitle = {Proceedings of the 9th International Conference on Conceptual Structures (ICCS 2001)}, crossref = {DBLP:conf/iccs/2001}, editor = {Harry S. Delugach and Gerd Stumme}, pages = {143-156}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = 2120, year = 2001, ee = {http://link.springer.de/link/service/series/0558/bibs/2120/21200143.htm}, bibsource = {DBLP, http://dblp.uni-trier.de}, isbn = {3-540-42344-3}, biburl = {http://www.bibsonomy.org/bibtex/2a25ab4987c25f31c9c7a69b9925ec8f9/jaeschke}, keywords = {analysis concept dynamic fca formal graphs lattice} } @inproceedings{troy2007faster, title = {Faster Concept Analysis}, address = {Berlin, Heidelberg}, author = {Adam D. Troy and Guo-Qiang Zhang and Ye Tian}, booktitle = {Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007)}, editor = {U. Priss and S. Polovina and R. Hill}, pages = {206--219}, publisher = {Springer-Verlag}, series = {Lecture Notes in Artificial Intelligence}, volume = 4604, year = 2007, url = {http://newton.cwru.edu/papers/MCA.pdf}, abstract = {We introduce a simple but efficient, multistage algorithm for constructing concept lattices (MCA). A concept lattice can be obtained as the closure system generated from attribute concepts (dually, object concepts). There are two strategies to use this as the basis of an algorithm: (a) forming intersections by joining one attribute concept at a time, and (b) repeatedly forming pairwise intersections starting from the attribute concepts. A straightforward translation of (b) to an algorithm suggests that pairwise intersection be performed among all cumulated concepts. MCA is parsimonious in forming the pairwise intersections: it only performs such operations among the newly formed concepts from the previous stage, instead of cumulatively. We show that this parsimonious multistage strategy is complete: it generates all concepts. To make this strategy really work, one must overcome the need to eliminate duplicates (and potentially save time even further), since concepts generated at a later stage may have already appeared in one of the earlier stages. As considered in several other algorithms in the literature [5], we achieve this by an auxiliary search tree which keeps all existing concepts as paths from the root to a flagged node or a leaf. The depth of the search tree is bounded by the total number of attributes, and hence the time complexity for concept lookup is bounded by the logarithm of the total number of concepts. For constructing lattice diagrams, we adapt a sub-quadratic algorithm of Pritchard [9] for computing subset partial orders to constructing the Hasse diagrams. Instead of the standard expected quadratic complexity, the Pritchard approach achieves a worst-case time O(N2/log N). Our experimental results showed significant improvements in speed for a variety of input profiles against three leading algorithms considered in the comprehensive comparative study [5]: Bordat, Chein, and Norris.}, biburl = {http://www.bibsonomy.org/bibtex/294f0a8c1cb1719df010e74056193e6b4/jaeschke}, keywords = {algorithm analysis concept fast fca formal} } @inproceedings{1244292, title = {FCA-based approach for mining contextualized folksonomy}, address = {New York, NY, USA}, author = {Hak Lae Kim and Suk Hyung Hwang and Hong Gee Kim}, booktitle = {SAC '07: Proceedings of the 2007 ACM symposium on Applied computing}, pages = {1340--1345}, publisher = {ACM Press}, year = 2007, url = {http://portal.acm.org/citation.cfm?id=1244002.1244292&coll=GUIDE&dl=}, location = {Seoul, Korea}, isbn = {1-59593-480-4}, doi = {http://doi.acm.org/10.1145/1244002.1244292}, biburl = {http://www.bibsonomy.org/bibtex/24440c3ca148004f3759456eac34e84fa/jaeschke}, keywords = {analysis concept fca folksonomy formal mining network social tagging} } @book{koch2003unterstuetzung, title = {Unterstützung der Formierung und Analyse von virtuellen Communities}, address = {Frankfurt am Main}, author = {Jürgen Hartmut Koch}, note = {PhD Thesis (2002)}, number = 39, publisher = {Peter Lang Publishing Group}, school = {Technische Universität München}, series = {Europäische Hochschulschriften}, volume = 41, year = 2003, isbn = {978-3-631-50288-4}, abstract = {Systeme, die den Informationsaustausch in Communities unterstützen, sind heute allgegenwärtig. Eine zielgerichtete Analyse solcher Communities ist allerdings nur schwer möglich, denn es gibt bislang kein Verfahren zur formalen Beschreibung virtueller Communities, auf dem aufbauend eine Analyse stattfinden könnte. Es wird ein Konzept vorgestellt, das die Brücke schlägt zwischen den natürlichsprachlichen Beschreibungen von virtuellen Communities in der Soziologie und der Psychologie, und einer formalen Beschreibung, wie sie für die zielgerichtete Software-Entwicklung nötig ist. Neben einem formalen Modell von virtuellen Communities wird ein komponentenbasierter Ansatz vorgestellt, der beschreibt, wie mit diesem Modell gezielt Unterstützungs- und Analysesysteme entwickelt werden können.}, biburl = {http://www.bibsonomy.org/bibtex/2683e13d82b21ff7ebb4afcc20958f762/jaeschke}, keywords = {analysis community support toread} } @misc{batagelj-2002, title = {Generalized Cores}, author = {V. Batagelj and M. Zaversnik}, note = {cs.DS/0202039}, year = 2002, url = {http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0202039}, description = {[cs/0202039] Generalized Cores}, abstract = {Cores are, besides connectivity components, one among few concepts that provides us with efficient decompositions of large graphs and networks. In the paper a generalization of the notion of core of a graph based on vertex property function is presented. It is shown that for the local monotone vertex property functions the corresponding cores can be determined in $O(m \max (\Delta, \log n))$ time.}, biburl = {http://www.bibsonomy.org/bibtex/204dd5c8a505463b1e196f842b91a8b07/jaeschke}, keywords = {analysis core generalized graph kcore network} }