@inproceedings{952761, title = {Ontology-focused crawling of Web documents}, address = {New York, NY, USA}, author = {Marc Ehrig and Alexander Maedche}, booktitle = {SAC '03: Proceedings of the 2003 ACM symposium on Applied computing}, pages = {1174--1178}, publisher = {ACM}, year = 2003, url = {http://www.aifb.uni-karlsruhe.de/WBS/meh/publications/ehrig03ontology.pdf}, location = {Melbourne, Florida}, isbn = {1-58113-624-2}, doi = {http://doi.acm.org/10.1145/952532.952761}, description = {Ontology-focused crawling of Web documents}, abstract = {The Web, the largest unstructured database of the world, has greatly improved access to documents. However, documents on the Web are largely disorganized. Due to the distributed nature of the World Wide Web it is difficult to use it as a tool for information and knowledge management. Therefore, users doing the difficult task of exploring the Web have to be supported by intelligent means.This paper proposes an approach for document discovery building on a comprehensive framework for ontology-focused crawling of Web documents. Our framework includes means for using a complex ontology and associated instance elements. It defines several relevance computation strategies and provides an empirical evaluation which has shown promising results.}, biburl = {http://www.bibsonomy.org/bibtex/29d9bcba93b086195f41402c83da3ff07/wnpxrz}, keywords = {crawling ontology proj:bk proj:gtf web} } @article{freeman1993, title = {{Using Galois Lattices to Represent Network Data}}, author = {L.C. Freeman and D.R. White}, journal = {Sociological Methodology}, pages = {127--146}, volume = 23, year = 1993, description = {focuses on bipartite / affiliation networks}, biburl = {http://www.bibsonomy.org/bibtex/250103469c4e839b6f05a522eaacaa3a8/wnpxrz}, keywords = {analysis network proj:bk sna social} } @article{hui2005, title = {{Extracting conceptual relationships from specialized documents}}, author = {B. Hui and E. Yu}, journal = {Data \& Knowledge Engineering}, number = 1, pages = {29--55}, publisher = {Elsevier}, volume = 54, year = 2005, biburl = {http://www.bibsonomy.org/bibtex/27659353f4454b308721a70f3be2a8805/wnpxrz}, keywords = {document extraction ie proj:kre relationship} } @misc{Butz2003Comparing, title = {Comparing Hierarchical Markov Networks and Multiply Sectioned Bayesian Networks}, author = {C.J. Butz and H. Geng}, year = 2003, url = {citeseer.ist.psu.edu/669674.html}, description = {Comparing Hierarchical Markov Networks and Multiply Sectioned Bayesian Networks (ResearchIndex)}, biburl = {http://www.bibsonomy.org/bibtex/2061e514f01016417c8f85ad474f29790/wnpxrz}, keywords = {av:online bayesian imported proj:o4p read} } @inproceedings{Butz2005Modelling, title = {Modelling multiagent Bayesian networks with inclusion dependencies}, author = {C.J. Butz and F. Fang}, booktitle = {Intelligent Agent Technology, IEEE/WIC/ACM International Conference on}, pages = {455- 458}, year = 2005, url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1565582}, isbn = {0-7695-2416-8}, doi = {10.1109/IAT.2005.103}, description = {Welcome to IEEE Xplore 2.0: Modelling multiagent Bayesian networks with inclusion dependencies}, abstract = {Multiagent Bayesian networks (MABNs) are a powerful new framework for uncertainty management in a distributed environment. In a MABN, a collective joint probability distribution is defined by the conditional probability tables (CPTs) supplied by the individual agents. It is assumed, however, that CPTs supplied by individual agents agree on the variable domains, an assumption that does not necessarily hold in practice. In this paper, we suggest modelling MABNs with inclusion dependencies. Our approach is more flexible, and perhaps realistic, by allowing CPTs supplied by different agents to disagree on variable domains. Our main result is that the input CPTs define a joint probability distribution if and only if certain inclusion dependencies are satisfied. Other advantages, both practical and theoretical, of modelling MABNs with inclusion dependencies are discussed.}, biburl = {http://www.bibsonomy.org/bibtex/26e94fac1d40810ad460beb2cad9706a8/wnpxrz}, keywords = {av:attached bayesian bn imported proj:o4p toread} } @misc{gasevic-approaching, title = {Approaching OWL and MDA through Technological Spaces}, author = {Dragan Gasevic and Dragan Djuric and Vladan Devedzic and Violeta Damjanovic}, year = 2004, url = {citeseer.ist.psu.edu/gasevic04approaching.html}, description = {Approaching OWL and MDA through Technological Spaces (ResearchIndex)}, biburl = {http://www.bibsonomy.org/bibtex/227dd635a16c3ffb2fb2a8e1fb7553fbf/wnpxrz}, keywords = {imported mda ontology owl proj:o4p toread} } @article{keyhere, title = {Petri net ontology}, author = {Dragan Gasevic and Vladan Devedzic}, journal = {Knowledge-Based Systems}, month = {#aug#}, number = 4, pages = {220--234}, volume = 19, year = 2006, url = {http://www.sciencedirect.com/science/article/B6V0P-4J9MRFP-1/2/b96857ea5354d98896096c69370e208c}, description = {ScienceDirect - Knowledge-Based Systems : Petri net ontology}, abstract = {The paper presents the Petri net ontology that enables sharing Petri nets on the Semantic Web. Previous work on formal methods for representing Petri nets mainly defines tool-specific descriptions or formats for model interchange. However, such efforts do not provide a suitable description for using Petri nets on the Semantic Web. This paper uses the Petri net UML model as a starting point for implementing the ontology. Resulting Petri net models are represented on the Semantic Web using XML-based ontology languages, RDF and OWL. We implemented a Petri net tool, P3, which can be used as a knowledge acquisition tool based on the Petri net ontology.}, biburl = {http://www.bibsonomy.org/bibtex/2989060334d7643a030e100db3fb91b9c/wnpxrz}, keywords = {net ontology petri proj:o4p semanticweb toread} } @article{Gasevic:8July2007:1476-1289:374, title = {Interoperable Petri net models via ontology}, author = {Dragan Gasevic and Vladan Devedzic}, journal = {International Journal of Web Engineering and Technology}, pages = {374-396(23)}, volume = 3, year = {8 July 2007}, url = {http://www.ingentaconnect.com/content/ind/ijwet/2007/00000003/00000004/art00002}, doi = {doi:10.1504/IJWET.2007.014439}, description = {IngentaConnect Interoperable Petri net models via ontology}, abstract = {The paper presents a Petri net infrastructure that should allow sharing Petri nets on the Semantic Web. Previous solutions only provide model interchange mechanisms between Petri net tools. The Petri net ontology is a central part of our solution. The ontology is closely related to the Petri Net Markup Language PNML an ongoing Petri net community sharing effort. We developed the Petri net ontology using both UML and the Protege tool, whereas we use RDF and OWL to represent the ontology. We implemented a Petri net software tool P3 that can be used to convert the Petri net ontology compliant models to the formats of current Petri net tools e.g., DaNAMiCS, Petri Net Kernel, PIPE using eXtensible Stylesheet Language Transformations XSLT. In order to show how the ontology can be used, we developed a simple educational web application that uses RDF-annotated ontology-based Petri net learning materials.}, biburl = {http://www.bibsonomy.org/bibtex/29b1e7019fa77f0d81f4e68a952e88bcf/wnpxrz}, keywords = {imported net ontology petri proj:o4p toread} } @article{FangWu11062007, title = {{Novelty and collective attention}}, author = {Fang Wu and Bernardo A. Huberman}, journal = {Proceedings of the National Academy of Sciences}, number = 45, pages = {17599-17601}, volume = 104, year = 2007, url = {http://www.pnas.org/cgi/content/abstract/104/45/17599}, doi = {10.1073/pnas.0704916104}, eprint = {http://www.pnas.org/cgi/reprint/104/45/17599.pdf}, description = {Novelty and collective attention -- Wu and Huberman 104 (45): 17599 -- Proceedings of the National Academy of Sciences}, abstract = {The subject of collective attention is central to an information age where millions of people are inundated with daily messages. It is thus of interest to understand how attention to novel items propagates and eventually fades among large populations. We have analyzed the dynamics of collective attention among 1 million users of an interactive web site, digg.com, devoted to thousands of novel news stories. The observations can be described by a dynamical model characterized by a single novelty factor. Our measurements indicate that novelty within groups decays with a stretched-exponential law, suggesting the existence of a natural time scale over which attention fades. }, biburl = {http://www.bibsonomy.org/bibtex/2395472c69e2f3c239d1d69817d23e894/wnpxrz}, keywords = {attention collective imported novelty proj:bk} } @article{Wong:2001, title = {Constructing the dependency structure of a multiagent probabilisticnetwork}, author = {S.K.M. Wong and C.J. Butz}, booktitle = {Transactions on Knowledge and Data Engineering}, pages = {395-415}, volume = 13, year = 2001, url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=929898}, issn = {1041-4347}, doi = {10.1109/69.929898}, description = {Welcome to IEEE Xplore 2.0: Constructing the dependency structure of a multiagent probabilisticnetwork}, abstract = {A probabilistic network consists of a dependency structure and corresponding probability tables. The dependency structure is a graphical representation of the conditional independencies that are known to hold in the problem domain. We propose an automated process for constructing the combined dependency structure of a multiagent probabilistic network. Each domain expert supplies any known conditional independency information and not necessarily an explicit dependency structure. Our method determines a succinct representation of all the supplied independency information called a minimal cover. This process involves detecting all inconsistent information and removing all redundant information. A unique dependency structure of the multiagent probabilistic network can be constructed directly from this minimal cover. The main result is that the constructed dependency structure is a perfect-map of the minimal cover. That is, every probabilistic conditional independency logically implied by the minimal cover can be inferred from the dependency structure and every probabilistic conditional independency inferred from the dependency structure is logically implied by the minimal cover}, biburl = {http://www.bibsonomy.org/bibtex/2fc0e8e91bd2ba381fb79d135268e9e7e/wnpxrz}, keywords = {bayesian imported proj:o4p toread} }