@misc{clauset2007powerlaw, abstract = {Power-law distributions occur in many situations of scientific interest and have significant consequences for our understanding of natural and man-made phenomena. Unfortunately, the detection and characterization of power laws is complicated by the large fluctuations that occur in the tail of the distribution -- the part of the distribution representing large but rare events -- and by the difficulty of identifying the range over which power-law behavior holds. Commonly used methods for analyzing power-law data, such as least-squares fitting, can produce substantially inaccurate estimates of parameters for power-law distributions, and even in cases where such methods return accurate answers they are still unsatisfactory because they give no indication of whether the data obey a power law at all. Here we present a principled statistical framework for discerning and quantifying power-law behavior in empirical data. Our approach combines maximum-likelihood fitting methods with goodness-of-fit tests based on the Kolmogorov-Smirnov statistic and likelihood ratios. We evaluate the effectiveness of the approach with tests on synthetic data and give critical comparisons to previous approaches. We also apply the proposed methods to twenty-four real-world data sets from a range of different disciplines, each of which has been conjectured to follow a power-law distribution. In some cases we find these conjectures to be consistent with the data while in others the power law is ruled out.}, author = {Clauset, Aaron and Shalizi, Cosma Rohilla and Newman, M. E. J.}, doi = {10.1137/070710111}, interhash = {2e3bc5bbd7449589e8bfb580e8936d4b}, intrahash = {7da1624e601898dd74df839ce2daeb24}, note = {cite arxiv:0706.1062Comment: 43 pages, 11 figures, 7 tables, 4 appendices; code available at http://www.santafe.edu/~aaronc/powerlaws/}, title = {Power-law distributions in empirical data}, url = {http://arxiv.org/abs/0706.1062}, year = 2007 } @inproceedings{atzmueller2013towards, address = {New York, NY, USA}, author = {Atzmueller, Martin and Hilgenberg, Katy}, booktitle = {Proc. 4th International Workshop on Modeling Social Media (MSM 2013), Hypertext 2013}, interhash = {b0d93d41ff9e84514d614cd2b3507a1d}, intrahash = {4ebea4979524a9c1c0d41845e41e33a9}, publisher = {ACM Press}, title = {{Towards Capturing Social Interactions with SDCF: An Extensible Framework for Mobile Sensing and Ubiquitous Data Collection}}, year = 2013 } @inproceedings{mitzlaff2011semantics, address = {Bamberg, Germany}, author = {Mitzlaff, Folke and Atzmueller, Martin and Stumme, Gerd and Hotho, Andreas}, booktitle = {Proc. LWA 2013 (KDML Special Track)}, interhash = {73088600a500f7d06768615d6e1c2b3d}, intrahash = {820ffb2166b330bf60bb30b16e426553}, publisher = {University of Bamberg}, title = {{On the Semantics of User Interaction in Social Media (Extended Abstract, Resubmission)}}, year = 2011 } @inproceedings{atzmueller2013sensor, address = {Hamburg, Germany}, author = {Atzmueller, Martin and Hilgenberg, Katy}, booktitle = {Proc. Sunbelt XXXIII: Annual Meeting of the International Network for Social Network Analysis}, interhash = {b71797fb6ff8776761d5227a61875470}, intrahash = {5f8a4602c1087ea93f1f7440050d1982}, publisher = {INSNA}, title = {{SDCF - A Sensor Data Collection Framework for Social and Ubiquitous Environments: Challenges and First Experiences in Sensor-based Social Networks (Abstract)}}, year = 2013 } @inproceedings{jaschke2013attribute, abstract = {We propose an approach for supporting attribute exploration by web information retrieval, in particular by posing appropriate queries to search engines, crowd sourcing systems, and the linked open data cloud. We discuss underlying general assumptions for this to work and the degree to which these can be taken for granted.}, author = {Jäschke, Robert and Rudolph, Sebastian}, booktitle = {Contributions to the 11th International Conference on Formal Concept Analysis}, editor = {Cellier, Peggy and Distel, Felix and Ganter, Bernhard}, interhash = {000ab7b0ae3ecd1d7d6ceb39de5c11d4}, intrahash = {45e900e280661d775d8da949baee3747}, month = may, organization = {Technische Universität Dresden}, pages = {19--34}, title = {Attribute Exploration on the Web}, url = {http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-113133}, urn = {urn:nbn:de:bsz:14-qucosa-113133}, year = 2013 } @article{mitzlaff2013userrelatedness, author = {Mitzlaff, Folke and Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd}, interhash = {40aa075d925f2e6e009986fd9e60b11b}, intrahash = {424d0f2d4a5c9a0eb68cbf2fc5b0010a}, journal = {CoRR/abs}, title = {{User-Relatedness and Community Structure in Social Interaction Networks}}, volume = {1309.3888}, year = 2013 } @inproceedings{kibanov2013evolution, address = {Bamberg, Germany}, author = {Kibanov, Mark and Atzmueller, Martin and Scholz, Christoph and Stumme, Gerd}, booktitle = {Proc. LWA 2013 (KDML Special Track)}, interhash = {84a970ee998f7e8d24b597c285e1887c}, intrahash = {a5d94c9930fd413a404efe6d9420a752}, publisher = {University of Bamberg}, title = {{Evolution of Contacts and Communities in Networks of Face-to-Face Proximity (Extended Abstract, Resubmission)}}, year = 2013 } @inproceedings{atzmueller2013subgroup, address = {Prague, Czech Republic}, author = {Atzmueller, Martin and Mueller, Juergen}, booktitle = {{Proceedings of the International Workshop on Mining Ubiquitous and Social Environments (MUSE2013)}}, interhash = {339aa18b5a6047ea4005f6c6a48b9bb6}, intrahash = {56661bf6212e1e5ab839640fdfba09b6}, title = {{Subgroup Analytics and Interactive Assessment on Ubiquitous Data}}, year = 2013 } @misc{atzmueller2013conferator, author = {Atzmueller, Martin and Kibanov, Mark and Scholz, Christoph and Stumme, Gerd}, howpublished = {Poster at INFORMATIK 2013}, institution = {University of Koblenz-Landau}, interhash = {caba49a0a623346dad82849aba632778}, intrahash = {2668432d7c035c34c4af4f6f96e22397}, publisher = {INFORMATIK 2013}, title = {{Conferator - a Social System for Conference and Contact Management}}, year = 2013 } @article{Fuchs2010379, abstract = {Subspace representations that preserve essential information of high-dimensional data may be advantageous for many reasons such as improved interpretability, overfitting avoidance, acceleration of machine learning techniques. In this article, we describe a new subspace representation of time series which we call polynomial shape space representation. This representation consists of optimal (in a least-squares sense) estimators of trend aspects of a time series such as average, slope, curve, change of curve, etc. The shape space representation of time series allows for a definition of a novel similarity measure for time series which we call shape space distance measure. Depending on the application, time series segmentation techniques can be applied to obtain a piecewise shape space representation of the time series in subsequent segments. In this article, we investigate the properties of the polynomial shape space representation and the shape space distance measure by means of some benchmark time series and discuss possible application scenarios in the field of temporal data mining.}, author = {Fuchs, Erich and Gruber, Thiemo and Pree, Helmuth and Sick, Bernhard}, doi = {10.1016/j.neucom.2010.03.022}, interhash = {88c499ac1dc9e9708e70187967494219}, intrahash = {fdf6865c1bece3f77cc3e29365a2c6b3}, issn = {0925-2312}, journal = {Neurocomputing}, note = {Artificial Brains}, number = {1–3}, pages = {379 - 393}, title = {Temporal data mining using shape space representations of time series}, url = {http://www.sciencedirect.com/science/article/pii/S0925231210002237}, volume = 74, year = 2010 } @incollection{ABP:11, author = {Atzmueller, Martin and Beer, Stephanie and Puppe, Frank}, booktitle = {Collaboration and the Semantic Web: Social Networks, Knowledge Networks, and Knowledge Resources}, editor = {Brüggemann, Stefan and d’Amato, Claudia}, interhash = {9c0d3f10e985d8654d8a2eae39121ef2}, intrahash = {781410de8780f9033aae08162cbdf073}, pages = {149-167}, publisher = {IGI Global}, title = {{Data Mining, Validation and Collaborative Knowledge Capture}}, year = 2012 } @article{Atzmueller:12, author = {Atzmueller, Martin}, interhash = {ce21e72d189207dbee58420af81efca8}, intrahash = {a66dc503e2f90d0a484e0dbef5febcd3}, journal = {Informatik Spektrum}, number = 2, pages = {132-135}, title = {Mining Social Media}, volume = 35, year = 2012 } @inproceedings{Atzmueller:12b, address = {New York, NY, USA}, author = {Atzmueller, Martin}, booktitle = {Proc. 3rd International Workshop on Modeling Social Media (MSM 2012), Hypertext 2012}, interhash = {59cc9a3c8221ebd802aa85acaba4506f}, intrahash = {52600def4f1f0d36b86ed4fbd15e353a}, publisher = {ACM Press}, title = {{Onto Collective Intelligence in Social Media: Exemplary Applications and Perspectives}}, year = 2012 } @incollection{LA:12, address = {Heidelberg, Germany}, alteditor = {Editor}, author = {Lemmerich, Florian and Atzmueller, Martin}, booktitle = {{Modeling and Mining Ubiquitous Social Media}}, interhash = {ae9dc5bfe7f42f1e9ca59aadda4bfd9e}, intrahash = {8435f029bf0e32340e2cf44d0eeb65e7}, publisher = {Springer Verlag}, series = {LNAI}, title = {{Describing Locations using Tags and Images: Explorative Pattern Mining in Social Media}}, url = {http://www.kde.cs.uni-kassel.de/atzmueller/paper/lemmerich-explorative-pattern-mining-socia-media-lnai-2012.pdf}, volume = 7472, year = 2012 } @proceedings{CAH:12, address = {New York, NY, USA}, editor = {Chin, Alvin and Atzmueller, Martin and Helic, Denis}, interhash = {8c21f6c9eb9d4658ca2374f12a63e950}, intrahash = {338ca2515a0f6cd77996d1bbf54c7f4d}, publisher = {ACM Press}, title = {{Proceedings MSM 2012: Workshop on Modeling Social Media -- Collective Intelligence in Social Media}}, year = 2012 } @inproceedings{AL:12a, address = {Heidelberg, Germany}, author = {Atzmueller, Martin and Lemmerich, Florian}, booktitle = {Proc. ECML/PKDD 2012: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases. accepted}, interhash = {6f00bb468dbc49b2adf426302bcf39f6}, intrahash = {e2aac1cdeabeeb4568e2ef4ffe9464d2}, publisher = {Springer Verlag}, title = {{VIKAMINE - Open-Source Subgroup Discovery, Pattern Mining, and Analytics}}, url = {http://www.kde.cs.uni-kassel.de/atzmueller/paper/atzmueller-vikamine2-ecml-pkdd-2012.pdf}, year = 2012 } @article{Atzmueller:12c, author = {Atzmueller, Martin}, interhash = {0b20c1d53d5df05326d594726273c2fb}, intrahash = {7b616e64994893a2aad95b5ad95db662}, journal = {WIREs: Data Mining and Knowledge Discovery}, title = {{Mining Social Media: Key Players, Sentiments, and Communities}}, volume = {In Press}, year = 2012 } @inproceedings{SNKA:12, address = {Bristol, UK}, author = {Seipel, Dietmar and Neubeck, Philipp and Köhler, Stefan and Atzmueller, Martin}, booktitle = {Proc. ECML/PKDD Workshop on New Frontiers in Mining Complex Patterns}, interhash = {6ddaf3fd7606e39482a97cbce7a01892}, intrahash = {e80737788c869221f272dd9af03acecf}, title = {{Mining Complex Event Patterns in Computer Networks}}, year = 2012 } @incollection{BAESSG:12, abstract = {To facilitate user-centered software engineering, developers need an easy to grasp understanding of the user. The use of personas helps to keep specific user needs in mind during the design process. Technology acceptance is of particular interest for the design of innovative applications previously unknown to potential users. Therefore, our research focuses on defining a typology of relevant user characteristics with respect to technology acceptance and transferring those findings to the description of personas. The presented work focuses on the statistical relationship between technology acceptance and personality. We apply sub-group discovery as a statistical tool. Based on the statistically derived subgroups and patterns we define the mentioned personas to help developers to understand different forms of technology acceptance. By integrating the specifically defined personas into existing methods in the field of software engineering the feasibility of the presented approach is demonstrated.}, address = {Heidelberg, Germany}, author = {Behrenbruch, Kay and Atzmueller, Martin and Evers, Christoph and Schmidt, Ludger and Stumme, Gerd and Geihs, Kurt}, booktitle = {Human-Centred Software Engineering}, interhash = {1e609af1021c5acbb5db78444c52a9e9}, intrahash = {847830846b80d4507aa4b93d1c8deb83}, pages = {259--266 }, publisher = {Springer}, series = {LNCS}, title = {{A Personality Based Design Approach Using Subgroup Discovery}}, volume = 7623, year = 2012 } @inproceedings{SAS:12, address = {Boston, MA, USA}, author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd}, booktitle = {Proc. Fourth ASE/IEEE International Conference on Social Computing (SocialCom)}, interhash = {9bc5d42018dbe8b926be214190258b3c}, intrahash = {be5ae4b92170e7c595f5fdcac15b4786}, publisher = {IEEE Computer Society}, title = {{On the Predictability of Human Contacts: Influence Factors and the Strength of Stronger Ties}}, url = {http://www.kde.cs.uni-kassel.de/atzmueller/paper/scholz-on-f2f-predictability-socialcom-2012.pdf}, year = 2012 } @incollection{ADHMS:12, address = {Heidelberg, Germany}, alteditor = {Editor}, author = {Atzmueller, Martin and Doerfel, Stephan and Hotho, Andreas and Mitzlaff, Folke and Stumme, Gerd}, booktitle = {{Modeling and Mining Ubiquitous Social Media}}, interhash = {4f1f4b515b01cc448a91b3e368deabad}, intrahash = {d81d6f6ccdf3ff6572898d39c90e6354}, publisher = {Springer Verlag}, series = {LNAI}, title = {Face-to-Face Contacts at a Conference: Dynamics of Communities and Roles}, url = {http://www.kde.cs.uni-kassel.de/atzmueller/paper/atzmueller-face-to-face-contacts-dynamics-lnai-2012.pdf}, volume = 7472, year = 2012 } @article{berendt2010bridging, author = {Berendt, Bettina and Hotho, Andreas and Stumme, Gerd}, doi = {DOI: 10.1016/j.websem.2010.04.008}, interhash = {4969eb2b7bf1fabe60c5f23ab6383d77}, intrahash = {f8d7bc2af5753906dc3897196daac18c}, issn = {1570-8268}, journal = {Web Semantics: Science, Services and Agents on the World Wide Web}, note = {Bridging the Gap--Data Mining and Social Network Analysis for Integrating Semantic Web and Web 2.0; The Future of Knowledge Dissemination: The Elsevier Grand Challenge for the Life Sciences}, number = {2-3}, pages = {95 - 96}, title = {Bridging the Gap--Data Mining and Social Network Analysis for Integrating Semantic Web and Web 2.0}, url = {http://www.sciencedirect.com/science/article/B758F-4YXK4HW-1/2/4cb514565477c54160b5e6eb716c32d7}, volume = 8, year = 2010 } @book{ABHS:10, editor = {Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd}, interhash = {9815398a19b44982b6e1b406d1eea00c}, intrahash = {060c675871a5e2173af200bd12f6f3ff}, publisher = {Department of Electrical Engineering/Computer Science, Kassel University}, series = {Technical report (KIS), 2010-10}, title = {{Proceedings of the LWA 2010 - Lernen, Wissen, Adaptivit\"at}}, year = 2010 } @inproceedings{hotho03ontologies, address = {Melbourne, Florida}, author = {Hotho, Andreas and Staab, Steffen and Stumme, Gerd}, booktitle = {Proceedings of the 2003 IEEE International Conference on Data Mining}, comment = {alpha}, interhash = {b56c36d6d9c9ca9e6bd236a0f92415a5}, intrahash = {57a39c81cff1982dbefed529be934bee}, month = {November 19-22,}, pages = {541-544 (Poster}, publisher = {IEEE {C}omputer {S}ociety}, title = {Ontologies improve text document clustering}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2003/hotho2003ontologies.pdf}, year = 2003 } @techreport{stumme99conceptualknowledge, author = {Stumme, G.}, comment = {alpha}, institution = {TU Darmstadt}, interhash = {c33970150f97bad7972281e38b42738f}, intrahash = {6d562dc043ba698acee8a83ce35bde6e}, title = {Conceptual Knowledge Discovery with Frequent Concept Lattices}, type = {{FB}4-{P}reprint 2043}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/1999/P2043.pdf}, year = 1999 } @incollection{stumme00conceptual, address = {Boston-Dordrecht-London}, author = {Stumme, G.}, booktitle = {Information Organization and Databases}, chapter = 14, comment = {alpha}, editor = {Tanaka, K. and Ghandeharizadeh, S. and Kambayashi, Y.}, interhash = {a016ce8dc9c298b435ab55d2c82f33ec}, intrahash = {d83a44b00abdeb6699f25c2652b51b84}, pages = {191-203}, publisher = {Kluwer}, title = {Conceptual {O}n-{L}ine {A}nalytical {P}rocessing}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/Kluwer00.ps}, year = 2000 } @inproceedings{bastide00levelwise, address = {France}, author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.}, booktitle = {Actes des 16ièmes Journées Bases de Données Avancées}, comment = {alpha}, interhash = {a3181cc73b190099592107cf465c4e43}, intrahash = {a11de6a74851c7076452159d1b12489b}, month = {Oct 24-27}, pages = {307-322}, publisher = {Blois}, title = {Levelwise Search of Frequent Patterns}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/BDA00.pdf}, year = 2000 } @inproceedings{studer03building, address = {Osaka, Japan}, author = {Studer, Rudi and Stumme, Gerd and Handschuh, Siegfried and Hotho, Andreas and Motik, B.}, booktitle = {New Trends in Knowledge Processing -- Data Mining, Semantic Web and Computational}, comment = {alpha}, interhash = {67d164f4a531ddf0f84df0b5de52e80a}, intrahash = {a0e7b52680f1876cdd9cd21f7cb2f95c}, month = {March 10-11,}, pages = {31-34}, title = {Building and Using the Semantic Web}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2003/Sanken03.pdf}, year = 2003 } @article{pasquier2005generating, author = {Pasquier, Nicolas and Taouil, Rafik and Bastide, Yves and Stumme, Gerd and Lakhal, Lotfi}, comment = {alpha}, interhash = {cb0ee99fae39f2a5e0af5be9d97978f5}, intrahash = {40f59a7fa7ce5015f9ee81709db89de0}, journal = {Journal Intelligent Information Systems (JIIS)}, number = 1, pages = {29-60}, publisher = {Kluwer Academic Publishers}, title = {Generating a Condensed Representation for Association Rules}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf}, volume = 24, year = 2005 } @inproceedings{hotho03wordnet, address = {Toronto}, author = {Hotho, A and Staab, S. and Stumme, G.}, booktitle = {Proc. SIGIR Semantic Web Workshop}, comment = {alpha}, interhash = {c2a9a89ce20cef90a1e78d34dc2c2afe}, intrahash = {04c7d86337d68e4ed9ae637029c43414}, title = {Wordnet improves text document clustering}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2003/hotho2003wordnet.pdf}, year = 2003 } @inproceedings{stumme97computing, address = {Vancouver, Canada}, author = {Stumme, Gerd and Wolff, Karl Erich}, booktitle = {Proc. Intl. Symposium on Knowledge Retrieval, Use, and Storage for Efficiency}, comment = {alpha}, interhash = {b04ab6b2046b85dba6d861ad23b8101a}, intrahash = {09244927cabf900accd89964a28c41de}, month = {Aug 11-13}, pages = {206-219}, title = {Computing in Conceptual Data systems with relational structures}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/1997/KRUSE97.pdf}, year = 1997 } @inbook{lakhal2005efficient, abstract = {Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to Formal Concept Analysis (FCA). In this survey, we will first introduce some basic ideas of this connection along a specific algorithm, \titanic, and show how FCA helps in reducing the number of resulting rules without loss of information, before giving a general overview over the history and state of the art of applying FCA for association rule mining.}, address = {Heidelberg}, author = {Lakhal, Lotfi and Stumme, Gerd}, booktitle = {Formal Concept Analysis: Foundations and Applications}, editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf}, ee = {http://dx.doi.org/10.1007/11528784_10}, interhash = {f5777a0f9dccfcf4f9968119d77297fc}, intrahash = {2b350f817428e4c6c7259cd279815091}, pages = {180-195}, publisher = {Springer}, series = {LNAI}, title = {Efficient Mining of Association Rules Based on Formal Concept Analysis}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf}, volume = 3626, year = 2005 } @inproceedings{stumme02efficient, address = {Heidelberg}, author = {Stumme, G.}, booktitle = {Database and Expert Systems Applications. Proc. DEXA 2002}, editor = {Hameurlain, A. and Cicchetti, R. and Traunmüller, R.}, interhash = {56611a15d60e2711a0aafc257715c03d}, intrahash = {0adce6a0db24566bb55d6e2d6667c8e7}, pages = {534-546}, publisher = {Springer}, series = {LNCS}, title = {Efficient Data Mining Based on Formal Concept Analysis}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2002/DEXA02.pdf}, volume = 2453, year = 2002 } @inproceedings{bastide00miningminimal, address = {Heidelberg}, author = {Bastide, Y. and Pasquier, N. and Taouil, R. and Stumme, G. and Lakhal, L.}, booktitle = {Computational Logic --- CL 2000 Proc. CL'00}, editor = {Lloyd, J. and Dahl, V. and Furbach, U. and Kerber, M. and Laus, K.-K. and Palamidessi, C. and Pereira, L.M. and Sagiv, Y. and Stuckey, P.J.}, interhash = {dc10d0ad3c40463f049ac775cb250f3d}, intrahash = {25fa3431e7bdd7057f9b80a7385cd718}, page = {972-986}, publisher = {Springer}, series = {LNAI}, title = {Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf}, volume = 1861, year = 2000 } @article{bastide00miningfrequent, author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.}, interhash = {86c9586115ef1c7ec8539257849d9842}, intrahash = {1e79f8ba76044d2c78cea441eeba84aa}, journal = {SIGKDD Explorations, Special Issue on Scalable Algorithms}, number = 2, pages = {71-80}, title = {Mining Frequent Patterns with Counting Inference.}, volume = 2, year = 2000 } @book{ferber2003information, address = {Heidelberg}, author = {Ferber, Reginald}, interhash = {52c1b4ab3e818efef6635eb76b778608}, intrahash = {b60dbc902a2e19877aec154fa5747751}, publisher = {dpunkt Verlag}, title = {Information Retrieval: Suchmodelle und Data-Mining-Verfahren für Textsammlungen und das Web}, url = {http://information-retrieval.de/}, year = 2003 }