Professor Barabási's talk described how the tools of network science can help understand the Web's structure, development and weaknesses. The Web is an information network, in which the nodes are documents (at the time of writing over one trillion of them), connected by links. Other well-known network structures include the Internet, a physical network where the nodes are routers and the links are physical connections, and organizations, where the nodes are people and the links represent communications.

@article{barabsi2013network, author = {Barabási, Albert-László}, title = {Network science}, journal = {Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences}, year = {2013}, volume = {371}, number = {1987}, url = {http://rsta.royalsocietypublishing.org/content/371/1987/20120375.abstract}, doi = {10.1098/rsta.2012.0375}, keywords = {analysis, network, sna, social, webscience}, abstract = {Professor Barabási's talk described how the tools of network science can help understand the Web's structure, development and weaknesses. The Web is an information network, in which the nodes are documents (at the time of writing over one trillion of them), connected by links. Other well-known network structures include the Internet, a physical network where the nodes are routers and the links are physical connections, and organizations, where the nodes are people and the links represent communications.} }

%0 = article %A = Barabási, Albert-László %D = 2013 %T = Network science %U = http://rsta.royalsocietypublishing.org/content/371/1987/20120375.abstract

The growth of the Web has required us to think about the design of information systems in which large-scale computational and social feedback effects are simultaneously at work. At the same time, the data generated by Web-scale systems—recording the ways in which millions of participants create content, link information, form groups and communicate with one another—have made it possible to evaluate long-standing theories of social interaction, and to formulate new theories based on what we observe. These developments have created a new level of interaction between computing and the social sciences, enriching the perspectives of both of these disciplines. We discuss some of the observations, theories and conclusions that have grown from the study of Web-scale social interaction, focusing on issues including the mechanisms by which people join groups, the ways in which different groups are linked together in social networks and the interplay of positive and negative interactions in these networks.

@article{kleinberg2013analysis, author = {Kleinberg, Jon}, title = {Analysis of large-scale social and information networks}, journal = {Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences}, year = {2013}, volume = {371}, number = {1987}, url = {http://rsta.royalsocietypublishing.org/content/371/1987/20120378.abstract}, doi = {10.1098/rsta.2012.0378}, keywords = {analysis, information, network, sna, social, webscience}, abstract = {The growth of the Web has required us to think about the design of information systems in which large-scale computational and social feedback effects are simultaneously at work. At the same time, the data generated by Web-scale systems—recording the ways in which millions of participants create content, link information, form groups and communicate with one another—have made it possible to evaluate long-standing theories of social interaction, and to formulate new theories based on what we observe. These developments have created a new level of interaction between computing and the social sciences, enriching the perspectives of both of these disciplines. We discuss some of the observations, theories and conclusions that have grown from the study of Web-scale social interaction, focusing on issues including the mechanisms by which people join groups, the ways in which different groups are linked together in social networks and the interplay of positive and negative interactions in these networks.} }

%0 = article %A = Kleinberg, Jon %D = 2013 %T = Analysis of large-scale social and information networks %U = http://rsta.royalsocietypublishing.org/content/371/1987/20120378.abstract

Studies on social networks have proved that endogenous and exogenous factors influence dynamics. Two streams of modeling exist on explaining the dynamics of social networks: 1) models predicting links through network properties, and 2) models considering the effects of social attributes. In this interdisciplinary study we work to overcome a number of computational limitations within these current models. We employ a mean-field model which allows for the construction of a population-specific socially informed model for predicting links from both network and social properties in large social networks. The model is tested on a population of conference coauthorship behavior, considering a number of parameters from available Web data. We address how large social networks can be modeled preserving both network and social parameters. We prove that the mean-field model, using a data-aware approach, allows us to overcome computational burdens and thus scalability issues in modeling large social networks in terms of both network and social parameters. Additionally, we confirm that large social networks evolve through both network and social-selection decisions; asserting that the dynamics of networks cannot singly be studied from a single perspective but must consider effects of social parameters.

@article{birkholz2012scalable, author = {Birkholz, Julie M. and Bakhshi, Rena and Harige, Ravindra and van Steen, Maarten and Groenewegen, Peter}, title = {Scalable Analysis of Socially Informed Network Models: the data-aware mean-field approach }, journal = {CoRR}, year = {2012}, volume = {abs/1209.6615}, url = {http://arxiv.org/abs/1209.6615}, keywords = {analysis, network, scalability, scientometrics, social, toread}, abstract = {Studies on social networks have proved that endogenous and exogenous factors influence dynamics. Two streams of modeling exist on explaining the dynamics of social networks: 1) models predicting links through network properties, and 2) models considering the effects of social attributes. In this interdisciplinary study we work to overcome a number of computational limitations within these current models. We employ a mean-field model which allows for the construction of a population-specific socially informed model for predicting links from both network and social properties in large social networks. The model is tested on a population of conference coauthorship behavior, considering a number of parameters from available Web data. We address how large social networks can be modeled preserving both network and social parameters. We prove that the mean-field model, using a data-aware approach, allows us to overcome computational burdens and thus scalability issues in modeling large social networks in terms of both network and social parameters. Additionally, we confirm that large social networks evolve through both network and social-selection decisions; asserting that the dynamics of networks cannot singly be studied from a single perspective but must consider effects of social parameters. } }

%0 = article %A = Birkholz, Julie M. and Bakhshi, Rena and Harige, Ravindra and van Steen, Maarten and Groenewegen, Peter %D = 2012 %T = Scalable Analysis of Socially Informed Network Models: the data-aware mean-field approach %U = http://arxiv.org/abs/1209.6615

@article{liu2012fulltext, author = {Liu, Xiaozhong and Zhang, Jinsong and Guo, Chun}, title = {Full-Text Citation Analysis: A New Method to Enhance Scholarly Network}, journal = {Journal of the American Society for Information Science and Technology}, year = {2012}, url = {http://discern.uits.iu.edu:8790/publication/Full%20text%20citation.pdf}, keywords = {analysis, citation, classification, graph, pagerank, ranking, scientometrics, sota, topic} }

%0 = article %A = Liu, Xiaozhong and Zhang, Jinsong and Guo, Chun %D = 2012 %T = Full-Text Citation Analysis: A New Method to Enhance Scholarly Network %U = http://discern.uits.iu.edu:8790/publication/Full%20text%20citation.pdf

We introduce the concepts of closed sets and closure operators as mathematical tools for the study of social networks. Dynamic networks are represented by transformations. It is shown that under continuous change/transformation, all networks tend to "break down" and become less complex. It is a kind of entropy. The product of this theoretical decomposition is an abundance of triadically closed clusters which sociologists have observed in practice. This gives credence to the relevance of this kind of mathematical analysis in the sociological context.

@inproceedings{pfaltz2012entropy, author = {Pfaltz, John L.}, title = {Entropy in Social Networks}, booktitle = {Proceedings of the SOCINFO}, year = {2012}, keywords = {analysis, closure, entropy, network, sna, social, toread}, abstract = {We introduce the concepts of closed sets and closure operators as mathematical tools for the study of social networks. Dynamic networks are represented by transformations. It is shown that under continuous change/transformation, all networks tend to "break down" and become less complex. It is a kind of entropy. The product of this theoretical decomposition is an abundance of triadically closed clusters which sociologists have observed in practice. This gives credence to the relevance of this kind of mathematical analysis in the sociological context. } }

%0 = inproceedings %A = Pfaltz, John L. %B = Proceedings of the SOCINFO %D = 2012 %T = Entropy in Social Networks

We propose an iterative and human-centred knowledge discovery methodology based on formal concept analysis. The proposed approach recognizes the important role of the domain expert in mining real-world enterprise applications and makes use of specific domain knowledge, including human intelligence and domain-specific constraints. Our approach was empirically validated at the Amsterdam-Amstelland police to identify suspects and victims of human trafficking in 266,157 suspicious activity reports. Based on guidelines of the Attorney Generals of the Netherlands, we first defined multiple early warning indicators that were used to index the police reports. Using concept lattices, we revealed numerous unknown human trafficking and loverboy suspects. In-depth investigation by the police resulted in a confirmation of their involvement in illegal activities resulting in actual arrestments been made. Our human-centred approach was embedded into operational policing practice and is now successfully used on a daily basis to cope with the vastly growing amount of unstructured information.

@article{poelmans2012semiautomated, author = {Poelmans, Jonas and Elzinga, Paul and Ignatov, Dmitry I. and Kuznetsov, Sergei O.}, title = {Semi-automated knowledge discovery: identifying and profiling human trafficking}, journal = {International Journal of General Systems}, year = {2012}, volume = {41}, number = {8}, pages = {774--804}, url = {http://www.tandfonline.com/doi/abs/10.1080/03081079.2012.721662}, doi = {10.1080/03081079.2012.721662}, keywords = {analysis, concept, fca, formal, kdd}, abstract = {We propose an iterative and human-centred knowledge discovery methodology based on formal concept analysis. The proposed approach recognizes the important role of the domain expert in mining real-world enterprise applications and makes use of specific domain knowledge, including human intelligence and domain-specific constraints. Our approach was empirically validated at the Amsterdam-Amstelland police to identify suspects and victims of human trafficking in 266,157 suspicious activity reports. Based on guidelines of the Attorney Generals of the Netherlands, we first defined multiple early warning indicators that were used to index the police reports. Using concept lattices, we revealed numerous unknown human trafficking and loverboy suspects. In-depth investigation by the police resulted in a confirmation of their involvement in illegal activities resulting in actual arrestments been made. Our human-centred approach was embedded into operational policing practice and is now successfully used on a daily basis to cope with the vastly growing amount of unstructured information.} }

%0 = article %A = Poelmans, Jonas and Elzinga, Paul and Ignatov, Dmitry I. and Kuznetsov, Sergei O. %D = 2012 %T = Semi-automated knowledge discovery: identifying and profiling human trafficking %U = http://www.tandfonline.com/doi/abs/10.1080/03081079.2012.721662

Usually scientists breed research ideas inspired by previous publications, but they are unlikely to follow all publications in the unbounded literature collection. The volume of literature keeps on expanding extremely fast, whilst not all papers contribute equal impact to the academic society. Being aware of potentially influential literature would put one in an advanced position in choosing important research references. Hence, estimation of potential influence is of great significance. We study a challenging problem of identifying potentially influential literature. We examine a set of hypotheses on what are the fundamental characteristics for highly cited papers and find some interesting patterns. Based on these observations, we learn to identify potentially influential literature via Future Influence Prediction (FIP), which aims to estimate the future influence of literature. The system takes a series of features of a particular publication as input and produces as output the estimated citation counts of that article after a given time period. We consider several regression models to formulate the learning process and evaluate their performance based on the coefficient of determination (R2). Experimental results on a real-large data set show a mean average predictive performance of 83.6% measured in R^2. We apply the learned model to the application of bibliography recommendation and obtain prominent performance improvement in terms of Mean Average Precision (MAP).

@inproceedings{yan2012better, author = {Yan, Rui and Huang, Congrui and Tang, Jie and Zhang, Yan and Li, Xiaoming}, title = {To better stand on the shoulder of giants}, booktitle = {Proceedings of the 12th ACM/IEEE-CS joint conference on Digital Libraries}, series = {JCDL '12}, publisher = {ACM}, address = {New York, NY, USA}, year = {2012}, pages = {51--60}, url = {http://doi.acm.org/10.1145/2232817.2232831}, doi = {10.1145/2232817.2232831}, isbn = {978-1-4503-1154-0}, keywords = {analysis, citation, scientometrics, sota}, abstract = {Usually scientists breed research ideas inspired by previous publications, but they are unlikely to follow all publications in the unbounded literature collection. The volume of literature keeps on expanding extremely fast, whilst not all papers contribute equal impact to the academic society. Being aware of potentially influential literature would put one in an advanced position in choosing important research references. Hence, estimation of potential influence is of great significance. We study a challenging problem of identifying potentially influential literature. We examine a set of hypotheses on what are the fundamental characteristics for highly cited papers and find some interesting patterns. Based on these observations, we learn to identify potentially influential literature via Future Influence Prediction (FIP), which aims to estimate the future influence of literature. The system takes a series of features of a particular publication as input and produces as output the estimated citation counts of that article after a given time period. We consider several regression models to formulate the learning process and evaluate their performance based on the coefficient of determination (R2). Experimental results on a real-large data set show a mean average predictive performance of 83.6% measured in R^2. We apply the learned model to the application of bibliography recommendation and obtain prominent performance improvement in terms of Mean Average Precision (MAP).} }

%0 = inproceedings %A = Yan, Rui and Huang, Congrui and Tang, Jie and Zhang, Yan and Li, Xiaoming %B = Proceedings of the 12th ACM/IEEE-CS joint conference on Digital Libraries %C = New York, NY, USA %D = 2012 %I = ACM %T = To better stand on the shoulder of giants %U = http://doi.acm.org/10.1145/2232817.2232831

The structure of a large network (graph) can often be revealed by partitioning it into smaller and possibly more dense sub-networks that are easier to handle. One of such decompositions is based on “

@article{batagelj2011algorithms, author = {Batagelj, Vladimir and Zaveršnik, Matjaž}, title = {Fast algorithms for determining (generalized) core groups in social networks}, journal = {Advances in Data Analysis and Classification}, publisher = {Springer}, year = {2011}, volume = {5}, number = {2}, pages = {129--145}, url = {http://dx.doi.org/10.1007/s11634-010-0079-y}, doi = {10.1007/s11634-010-0079-y}, issn = {1862-5347}, keywords = {analysis, core, network, sna, social}, abstract = {The structure of a large network (graph) can often be revealed by partitioning it into smaller and possibly more dense sub-networks that are easier to handle. One of such decompositions is based on “} }

%0 = article %A = Batagelj, Vladimir and Zaveršnik, Matjaž %D = 2011 %I = Springer %T = Fast algorithms for determining (generalized) core groups in social networks %U = http://dx.doi.org/10.1007/s11634-010-0079-y

We propose a method to evaluate the significance of historical entities (people, events, and so on.). Here, the significance of a historical entity means how it affected other historical entities. Our proposed method first calculates the tempo-spacial impact of historical entities. The impact of a historical entity varies according to time and location. Historical entities are collected from Wikipedia. We assume that a Wikipedia link between historical entities represents an impact propagation. That is, when an entity has a link to another entity, we regard the former is influenced by the latter. Historical entities in Wikipedia usually have the date and location of their occurrence. Our proposed iteration algorithm propagates such initial tempo-spacial information through links in the similar manner as PageRank, so the tempo-spacial impact scores of all the historical entities can be calculated. We assume that a historical entity is significant if it influences many other entities that are far from it temporally or geographically. We demonstrate a prototype system and show the results of experiments that prove the effectiveness of our method.

@inproceedings{takahashi2011evaluating, author = {Takahashi, Yuku and Ohshima, Hiroaki and Yamamoto, Mitsuo and Iwasaki, Hirotoshi and Oyama, Satoshi and Tanaka, Katsumi}, title = {Evaluating significance of historical entities based on tempo-spatial impacts analysis using Wikipedia link structure}, booktitle = {Proceedings of the 22nd ACM conference on Hypertext and hypermedia}, publisher = {ACM}, address = {New York, NY, USA}, year = {2011}, pages = {83--92}, url = {http://doi.acm.org/10.1145/1995966.1995980}, doi = {10.1145/1995966.1995980}, isbn = {978-1-4503-0256-2}, keywords = {analysis, history, link, pagerank, wikipedia}, abstract = {We propose a method to evaluate the significance of historical entities (people, events, and so on.). Here, the significance of a historical entity means how it affected other historical entities. Our proposed method first calculates the tempo-spacial impact of historical entities. The impact of a historical entity varies according to time and location. Historical entities are collected from Wikipedia. We assume that a Wikipedia link between historical entities represents an impact propagation. That is, when an entity has a link to another entity, we regard the former is influenced by the latter. Historical entities in Wikipedia usually have the date and location of their occurrence. Our proposed iteration algorithm propagates such initial tempo-spacial information through links in the similar manner as PageRank, so the tempo-spacial impact scores of all the historical entities can be calculated. We assume that a historical entity is significant if it influences many other entities that are far from it temporally or geographically. We demonstrate a prototype system and show the results of experiments that prove the effectiveness of our method.} }

%0 = inproceedings %A = Takahashi, Yuku and Ohshima, Hiroaki and Yamamoto, Mitsuo and Iwasaki, Hirotoshi and Oyama, Satoshi and Tanaka, Katsumi %B = Proceedings of the 22nd ACM conference on Hypertext and hypermedia %C = New York, NY, USA %D = 2011 %I = ACM %T = Evaluating significance of historical entities based on tempo-spatial impacts analysis using Wikipedia link structure %U = http://doi.acm.org/10.1145/1995966.1995980

The Scholarly Database aims to serve researchers and practitioners interested in the analysis, modelling, and visualization of large-scale data sets. A specific focus of this database is to support macro-evolutionary studies of science and to communicate findings via knowledge-domain visualizations. Currently, the database provides access to about 18 million publications, patents, and grants. About 90% of the publications are available in full text. Except for some datasets with restricted access conditions, the data can be retrieved in raw or pre-processed formats using either a web-based or a relational database client. This paper motivates the need for the database from the perspective of bibliometric/scientometric research. It explains the database design, setup, etc., and reports the temporal, geographical, and topic coverage of data sets currently served via the database. Planned work and the potential for this database to become a global testbed for information science research are discussed at the end of the paper.

@article{larowe2009scholarly, author = {La Rowe, Gavin and Ambre, Sumeet and Burgoon, John and Ke, Weimao and Börner, Katy}, title = {The Scholarly Database and its utility for scientometrics research}, journal = {Scientometrics}, publisher = {Springer Netherlands}, year = {2009}, volume = {79}, number = {2}, pages = {219--234}, url = {http://dx.doi.org/10.1007/s11192-009-0414-2}, doi = {10.1007/s11192-009-0414-2}, issn = {0138-9130}, keywords = {analysis, database, dataset, gaw, science, scientometrics, sdb, sota}, abstract = {The Scholarly Database aims to serve researchers and practitioners interested in the analysis, modelling, and visualization of large-scale data sets. A specific focus of this database is to support macro-evolutionary studies of science and to communicate findings via knowledge-domain visualizations. Currently, the database provides access to about 18 million publications, patents, and grants. About 90% of the publications are available in full text. Except for some datasets with restricted access conditions, the data can be retrieved in raw or pre-processed formats using either a web-based or a relational database client. This paper motivates the need for the database from the perspective of bibliometric/scientometric research. It explains the database design, setup, etc., and reports the temporal, geographical, and topic coverage of data sets currently served via the database. Planned work and the potential for this database to become a global testbed for information science research are discussed at the end of the paper.} }

%0 = article %A = La Rowe, Gavin and Ambre, Sumeet and Burgoon, John and Ke, Weimao and Börner, Katy %D = 2009 %I = Springer Netherlands %T = The Scholarly Database and its utility for scientometrics research %U = http://dx.doi.org/10.1007/s11192-009-0414-2

The DBLP Computer Science Bibliography evolved from an early small experimental Web server to a popular service for the computer science community. Many design decisions and details of the public XML-records behind DBLP never were documented. This paper is a review of the evolution of DBLP. The main perspective is data modeling. In DBLP persons play a central role, our discussion of person names may be applicable to many other data bases. All DBLP data are available for your own experiments. You may either download the complete set, or use a simple XML-based API described in an online appendix.

@article{ley2009lessons, author = {Ley, Michael}, title = {DBLP: some lessons learned}, journal = {Proceedings of the VLDB Endowment}, publisher = {VLDB Endowment}, year = {2009}, volume = {2}, number = {2}, pages = {1493--1500}, url = {http://dl.acm.org/citation.cfm?id=1687553.1687577}, issn = {2150-8097}, keywords = {analysis, author, bibliography, citation, computer, dblp, entity, extraction, identification, ie, information, named, resolution, science}, abstract = {The DBLP Computer Science Bibliography evolved from an early small experimental Web server to a popular service for the computer science community. Many design decisions and details of the public XML-records behind DBLP never were documented. This paper is a review of the evolution of DBLP. The main perspective is data modeling. In DBLP persons play a central role, our discussion of person names may be applicable to many other data bases. All DBLP data are available for your own experiments. You may either download the complete set, or use a simple XML-based API described in an online appendix.} }

%0 = article %A = Ley, Michael %D = 2009 %I = VLDB Endowment %T = DBLP: some lessons learned %U = http://dl.acm.org/citation.cfm?id=1687553.1687577

The use of lattice-based access control models has been somewhat restricted by their complexity. We argue that attribute exploration from formal concept analysis can help create lattice models of manageable size, while making it possible for the system designer to better understand dependencies between different security categories in the domain and, thus, providing certain guarantees for the relevance of the constructed model to a particular application. In this paper, we introduce the method through an example.

@article{obiedkov2009building, author = {Obiedkov, Sergei and Kourie, Derrick G. and Eloff, J.H.P.}, title = {Building access control models with attribute exploration}, journal = {Computers and Security}, year = {2009}, volume = {28}, number = {1–2}, pages = {2--7}, url = {http://www.sciencedirect.com/science/article/pii/S0167404808000497}, doi = {10.1016/j.cose.2008.07.011}, issn = {0167-4048}, keywords = {access, analysis, attribute, concept, control, exploration, fca, formal, security}, abstract = {The use of lattice-based access control models has been somewhat restricted by their complexity. We argue that attribute exploration from formal concept analysis can help create lattice models of manageable size, while making it possible for the system designer to better understand dependencies between different security categories in the domain and, thus, providing certain guarantees for the relevance of the constructed model to a particular application. In this paper, we introduce the method through an example.} }

%0 = article %A = Obiedkov, Sergei and Kourie, Derrick G. and Eloff, J.H.P. %D = 2009 %T = Building access control models with attribute exploration %U = http://www.sciencedirect.com/science/article/pii/S0167404808000497

Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect strangers as long as they have common interests. del.icio.us is a social network where people store and share their personal bookmarks. Most importantly, users tag their bookmarks for ease of information dissemination and later look up. However, it is the friendship links, that make delicious a social network. They exist independently of the set of bookmarks that belong to the users and have no relation to the tags typically assigned to the bookmarks. To study the interaction among users, the strength of the existing links and their hidden meaning, we introduce implicit links in the network. These links connect only highly "similar" users. Here, similarity can reflect different aspects of the user’s profile that makes her similar to any other user, such as number of shared bookmarks, or similarity of their tags clouds. We investigate the question whether friends have common interests, we gain additional insights on the strategies that users use to assign tags to their bookmarks, and we demonstrate that the graphs formed by implicit links have unique properties differing from binomial random graphs or random graphs with an expected power-law degree distribution.

@inproceedings{angelova2008characterizing, author = {Angelova, Ralitsa and Lipczak, Marek and Milios, Evangelos and Prałat, Paweł}, title = {Characterizing a social bookmarking and tagging network}, booktitle = {Proceedings of the Mining Social Data Workshop (MSoDa)}, year = {2008}, pages = {21--25}, url = {http://www.math.ryerson.ca/~pralat/papers/2008_delicious.pdf}, keywords = {analysis, bookmarking, collaborative, folksonomy, network, tagging}, abstract = {Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect strangers as long as they have common interests. del.icio.us is a social network where people store and share their personal bookmarks. Most importantly, users tag their bookmarks for ease of information dissemination and later look up. However, it is the friendship links, that make delicious a social network. They exist independently of the set of bookmarks that belong to the users and have no relation to the tags typically assigned to the bookmarks. To study the interaction among users, the strength of the existing links and their hidden meaning, we introduce implicit links in the network. These links connect only highly "similar" users. Here, similarity can reflect different aspects of the user’s profile that makes her similar to any other user, such as number of shared bookmarks, or similarity of their tags clouds. We investigate the question whether friends have common interests, we gain additional insights on the strategies that users use to assign tags to their bookmarks, and we demonstrate that the graphs formed by implicit links have unique properties differing from binomial random graphs or random graphs with an expected power-law degree distribution. } }

%0 = inproceedings %A = Angelova, Ralitsa and Lipczak, Marek and Milios, Evangelos and Prałat, Paweł %B = Proceedings of the Mining Social Data Workshop (MSoDa) %D = 2008 %T = Characterizing a social bookmarking and tagging network %U = http://www.math.ryerson.ca/~pralat/papers/2008_delicious.pdf

We propose an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by the knowledge base and by a domain expert. The use of techniques from Formal Concept Analysis ensures that, on the one hand, the interaction with the expert is kept to a minimum, and, on the other hand, we can show that the extended knowledge base is complete in a certain, well-defined sense.

@inproceedings{baader2007completing, author = {Baader, Franz and Ganter, Bernhard and Sertkaya, Baris and Sattler, Ulrike}, title = {Completing description logic knowledge bases using formal concept analysis}, booktitle = {Proceedings of the 20th international joint conference on Artifical intelligence}, publisher = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco, CA, USA}, year = {2007}, pages = {230--235}, url = {http://dl.acm.org/citation.cfm?id=1625275.1625311}, keywords = {analysis, base, complete, concept, description, dl, fca, formal, knowledge, logic, ontology}, abstract = {We propose an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by the knowledge base and by a domain expert. The use of techniques from Formal Concept Analysis ensures that, on the one hand, the interaction with the expert is kept to a minimum, and, on the other hand, we can show that the extended knowledge base is complete in a certain, well-defined sense.} }

%0 = inproceedings %A = Baader, Franz and Ganter, Bernhard and Sertkaya, Baris and Sattler, Ulrike %B = Proceedings of the 20th international joint conference on Artifical intelligence %C = San Francisco, CA, USA %D = 2007 %I = Morgan Kaufmann Publishers Inc. %T = Completing description logic knowledge bases using formal concept analysis %U = http://dl.acm.org/citation.cfm?id=1625275.1625311

The modeling of realistic networks is of great importance for modern complex systems research. Previous procedures typically model the natural growth of networks by means of iteratively adding nodes, geometric positioning information, a definition of link connectivity based on the preference for nearest neighbors or already highly connected nodes, or combine several of these approaches. Our novel model is based on the well-know concept of k-cores, originally introduced in social network analysis. Recent studies exposed the significant k-core structure of several real world systems, e.g. the AS network of the Internet. We present a simple and efficient method for generating networks which strictly adhere to the characteristics of a given k-core structure, called core fingerprint. We show-case our algorithm in a comparative evaluation with two well-known AS network generators.

@inproceedings{baur2007generating, author = {Baur, Michael and Gaertler, Marco and Görke, Robert and Krug, Marcus and Wagner, Dorothea}, title = {Generating Graphs with Predefined k-Core Structure}, booktitle = {Proceedings of the European Conference of Complex Systems}, year = {2007}, url = {http://i11www.ira.uka.de/extra/publications/bggkw-ggpcs-07.pdf}, keywords = {analysis, core, generator, graph, structure}, abstract = {The modeling of realistic networks is of great importance for modern complex systems research. Previous procedures typically model the natural growth of networks by means of iteratively adding nodes, geometric positioning information, a definition of link connectivity based on the preference for nearest neighbors or already highly connected nodes, or combine several of these approaches. Our novel model is based on the well-know concept of k-cores, originally introduced in social network analysis. Recent studies exposed the significant k-core structure of several real world systems, e.g. the AS network of the Internet. We present a simple and efficient method for generating networks which strictly adhere to the characteristics of a given k-core structure, called core fingerprint. We show-case our algorithm in a comparative evaluation with two well-known AS network generators. } }

%0 = inproceedings %A = Baur, Michael and Gaertler, Marco and Görke, Robert and Krug, Marcus and Wagner, Dorothea %B = Proceedings of the European Conference of Complex Systems %D = 2007 %T = Generating Graphs with Predefined k-Core Structure %U = http://i11www.ira.uka.de/extra/publications/bggkw-ggpcs-07.pdf

We introduce a new method for finding nodes semantically related to a given node in a hyperlinked graph: the Green method, based on a classical Markov chain tool. It is generic, adjustment-free and easy to implement. We test it in the case of the hyperlink structure of the English version of Wikipedia, the on-line encyclopedia. We present an extensive comparative study of the performance of our method versus several other classical methods in the case of Wikipedia. The Green method is found to have both the best average results and the best robustness.

@inproceedings{ollivier2007finding, author = {Ollivier, Yann and Senellart, Pierre}, title = {Finding related pages using Green measures: an illustration with Wikipedia}, booktitle = {Proceedings of the 22nd national conference on Artificial intelligence}, publisher = {AAAI Press}, year = {2007}, volume = {2}, pages = {1427--1433}, url = {http://dl.acm.org/citation.cfm?id=1619797.1619874}, isbn = {978-1-57735-323-2}, keywords = {analysis, link, pagerank, similarity, wikipedia}, abstract = {We introduce a new method for finding nodes semantically related to a given node in a hyperlinked graph: the Green method, based on a classical Markov chain tool. It is generic, adjustment-free and easy to implement. We test it in the case of the hyperlink structure of the English version of Wikipedia, the on-line encyclopedia. We present an extensive comparative study of the performance of our method versus several other classical methods in the case of Wikipedia. The Green method is found to have both the best average results and the best robustness.} }

%0 = inproceedings %A = Ollivier, Yann and Senellart, Pierre %B = Proceedings of the 22nd national conference on Artificial intelligence %D = 2007 %I = AAAI Press %T = Finding related pages using Green measures: an illustration with Wikipedia %U = http://dl.acm.org/citation.cfm?id=1619797.1619874

In this paper, we discuss two graphs in Wikipedia (i) the article graph, and (ii) the category graph. We perform a graph-theoretic analysis of the category graph, and show that it is a scale-free, small world graph like other well-known lexical semantic networks. We substantiate our findings by transferring semantic relatedness algorithms defined on WordNet to the Wikipedia category graph. To assess the usefulness of the category graph as an NLP resource, we analyze its coverage and the performance of the transferred semantic relatedness algorithms.

@inproceedings{zesch2007analysis, author = {Zesch, Torsten and Gurevych, Iryna}, title = {Analysis of the Wikipedia Category Graph for NLP Applications}, booktitle = {Proceedings of the TextGraphs-2 Workshop (NAACL-HLT)}, publisher = {Association for Computational Linguistics}, address = {Rochester}, year = {2007}, pages = {1--8}, url = {http://acl.ldc.upenn.edu/W/W07/W07-02.pdf#page=11}, keywords = {analysis, category, graph, language, natural, network, nlp, processing, wikipedia}, abstract = {In this paper, we discuss two graphs in Wikipedia (i) the article graph, and (ii) the category graph. We perform a graph-theoretic analysis of the category graph, and show that it is a scale-free, small world graph like other well-known lexical semantic networks. We substantiate our findings by transferring semantic relatedness algorithms defined on WordNet to the Wikipedia category graph. To assess the usefulness of the category graph as an NLP resource, we analyze its coverage and the performance of the transferred semantic relatedness algorithms. } }

%0 = inproceedings %A = Zesch, Torsten and Gurevych, Iryna %B = Proceedings of the TextGraphs-2 Workshop (NAACL-HLT) %C = Rochester %D = 2007 %I = Association for Computational Linguistics %T = Analysis of the Wikipedia Category Graph for NLP Applications %U = http://acl.ldc.upenn.edu/W/W07/W07-02.pdf#page=11

This book deals with Formal Concept Analysis (FCA) and its application to Web Information Retrieval. It explains how Web search results retrieved by major Web search engines such as Google or Yahoo can be conceptualized leading to a human-oriented form of representation. A generalization of Web search results is conducted, leading to an FCA-based introduction of FooCA. FooCA is an application in the field of Conceptual Knowledge Processing and supports the idea of a holistic representation of Web Information Retrieval.

@book{koester2006fooca, author = {Koester, Bjoern}, title = {FooCA: web information retrieval with formal concept analysis}, series = {Beiträge zur begrifflichen Wissensverarbeitung}, publisher = {Verlag Allgemeine Wissenschaft}, address = {Mühltal}, year = {2006}, url = {http://www.bjoern-koester.de/fooca/web_information_retrieval_with_formal_concept_analysis.html}, keywords = {analysis, concept, fca, fooca, formal, information, ir, retrieval, web}, abstract = {This book deals with Formal Concept Analysis (FCA) and its application to Web Information Retrieval. It explains how Web search results retrieved by major Web search engines such as Google or Yahoo can be conceptualized leading to a human-oriented form of representation. A generalization of Web search results is conducted, leading to an FCA-based introduction of FooCA. FooCA is an application in the field of Conceptual Knowledge Processing and supports the idea of a holistic representation of Web Information Retrieval.} }

%0 = book %A = Koester, Bjoern %C = Mühltal %D = 2006 %I = Verlag Allgemeine Wissenschaft %T = FooCA: web information retrieval with formal concept analysis %U = http://www.bjoern-koester.de/fooca/web_information_retrieval_with_formal_concept_analysis.html

Conceptual Information Systems are based on a formalization of the concept of ‘concept’ as it is discussed in traditional philosophical logic. This formalization supports a human-centered approach to the development of Information Systems. We discuss this approach by means of an implemented Conceptual Information System for supporting IT security management in companies and organizations.

@incollection{becker2000conceptual, author = {Becker, Klaus and Stumme, Gerd and Wille, Rudolf and Wille, Uta and Zickwolff, Monika}, title = {Conceptual Information Systems Discussed through an IT-Security Tool}, editor = {Dieng, Rose and Corby, Olivier}, booktitle = {Knowledge Engineering and Knowledge Management Methods, Models, and Tools}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, address = {Berlin/Heidelberg}, year = {2000}, volume = {1937}, pages = {352--365}, url = {http://dx.doi.org/10.1007/3-540-39967-4_27}, doi = {10.1007/3-540-39967-4_27}, isbn = {978-3-540-41119-2}, keywords = {analysis, concept, example, fca, formal, grundschutz, gshb, security}, abstract = {Conceptual Information Systems are based on a formalization of the concept of ‘concept’ as it is discussed in traditional philosophical logic. This formalization supports a human-centered approach to the development of Information Systems. We discuss this approach by means of an implemented Conceptual Information System for supporting IT security management in companies and organizations.} }

%0 = incollection %A = Becker, Klaus and Stumme, Gerd and Wille, Rudolf and Wille, Uta and Zickwolff, Monika %B = Knowledge Engineering and Knowledge Management Methods, Models, and Tools %C = Berlin/Heidelberg %D = 2000 %I = Springer %T = Conceptual Information Systems Discussed through an IT-Security Tool %U = http://dx.doi.org/10.1007/3-540-39967-4_27

We are investigating automatic generation of a review (or survey) article in a specific subject domain. In a research paper, there are passages where the author describes the essence of a cited paper and the differences between the current paper and the cited paper (we call them citing areas). These passages can be considered as a kind of summary of the cited paper from the current author's viewpoint. We can know the state of the art in a specific subject domain from the collection of citing areas. FUrther, if these citing areas are properly classified and organized, they can act 8.', a kind of a review article. In our previous research, we proposed the automatic extraction of citing areas. Then, with the information in the citing areas, we automatically identified the types of citation relationships that indicate the reasons for citation (we call them citation types). Citation types offer a useful clue for organizing citing areas. In addition, to support writing a review article, it is necessary to take account of the contents of the papers together with the citation links and citation types. In this paper, we propose several methods for classifying papers automatically. We found that our proposed methods BCCT-C, the bibliographic coupling considering only type C citations, which pointed out the problems or gaps in related works, are more effective than others. We also implemented a prototype system to support writing a review article, which is based on our proposed method.

@article{nanba2000classification, author = {Nanba, H. and Kando, N. and Okumura, M.}, title = {Classification of research papers using citation links and citation types: Towards automatic review article generation}, journal = {11th ASIS SIG/CR Classification Research Workshop}, year = {2000}, pages = {117--134}, url = {http://journals.lib.washington.edu/index.php/acro/article/download/12774/11255}, keywords = {analysis, citation, classification, scientometrics, sota}, abstract = {We are investigating automatic generation of a review (or survey) article in a specific subject domain. In a research paper, there are passages where the author describes the essence of a cited paper and the differences between the current paper and the cited paper (we call them citing areas). These passages can be considered as a kind of summary of the cited paper from the current author's viewpoint. We can know the state of the art in a specific subject domain from the collection of citing areas. FUrther, if these citing areas are properly classified and organized, they can act 8.', a kind of a review article. In our previous research, we proposed the automatic extraction of citing areas. Then, with the information in the citing areas, we automatically identified the types of citation relationships that indicate the reasons for citation (we call them citation types). Citation types offer a useful clue for organizing citing areas. In addition, to support writing a review article, it is necessary to take account of the contents of the papers together with the citation links and citation types. In this paper, we propose several methods for classifying papers automatically. We found that our proposed methods BCCT-C, the bibliographic coupling considering only type C citations, which pointed out the problems or gaps in related works, are more effective than others. We also implemented a prototype system to support writing a review article, which is based on our proposed method.} }

%0 = article %A = Nanba, H. and Kando, N. and Okumura, M. %D = 2000 %T = Classification of research papers using citation links and citation types: Towards automatic review article generation %U = http://journals.lib.washington.edu/index.php/acro/article/download/12774/11255