標題: Titlebook: Conceptual Structures for Discovering Knowledge; 19th International C Simon Andrews,Simon Polovina,Babak Akhgar Conference proceedings 2011 [打印本頁] 作者: vein220 時間: 2025-3-21 17:18
書目名稱Conceptual Structures for Discovering Knowledge影響因子(影響力)
書目名稱Conceptual Structures for Discovering Knowledge影響因子(影響力)學科排名
書目名稱Conceptual Structures for Discovering Knowledge網(wǎng)絡公開度
書目名稱Conceptual Structures for Discovering Knowledge網(wǎng)絡公開度學科排名
書目名稱Conceptual Structures for Discovering Knowledge被引頻次
書目名稱Conceptual Structures for Discovering Knowledge被引頻次學科排名
書目名稱Conceptual Structures for Discovering Knowledge年度引用
書目名稱Conceptual Structures for Discovering Knowledge年度引用學科排名
書目名稱Conceptual Structures for Discovering Knowledge讀者反饋
書目名稱Conceptual Structures for Discovering Knowledge讀者反饋學科排名
作者: Collected 時間: 2025-3-21 20:57 作者: Reclaim 時間: 2025-3-22 03:42
A Buzz and E-Reputation Monitoring Tool for Twitter Based on Galois Latticesproperties of a collection of objects is the main task of the Galois lattices used in the Formal Concept Analysis. In this article we state clearly the characteristics, advantages and constraints of one of the more successful online social networks: Twitter. Then we detail the difficult task of trac作者: RACE 時間: 2025-3-22 07:02
Identifying Relations between Medical Concepts by Parsing UMLS??Definitionse apply additional extraction, alternation and validation rules and built a set of new relations to be inserted in our conceptual resource. The article presents the input data and available tools, the knowledge chunks extracted from UMLS and their processing, as well as a discussion of the present r作者: anniversary 時間: 2025-3-22 12:35
A. Geske Dijkstra,Anders Danielson partial orders. It allows the user to use his/her background knowledge to navigate through the partial order, without a priori pruning. We illustrate how our method can be applied on two different tasks (software engineering and natural language processing) and two different kinds of patterns (asso作者: alleviate 時間: 2025-3-22 14:46 作者: alleviate 時間: 2025-3-22 19:53 作者: flex336 時間: 2025-3-23 00:39
Conference proceedings 2011 management. Two of the workshops contained in this volume cover CS and knowledge discovery in under-traversed domains and in task specific information retrieval. The third addresses CD in learning, teaching and assessment.作者: 載貨清單 時間: 2025-3-23 04:11
A.N. Prior’s Ideas on Tensed Ontologyesting ideas concerning tensed ontology. In particular, the paper discusses Prior’s own contribution to tensed ontology, which may be seen as a further development of Le?niewski’s ontology. Finally, the paper presents some challenges regarding the significance of tensed ontology in philosophy and information architecture.作者: BLANK 時間: 2025-3-23 09:05 作者: 欺騙世家 時間: 2025-3-23 11:59
Expressing Conceptual Graph Queries from Patterns: How to Take into Account the Relationsd instanciates them with regard to the keywords of the initial query. Several possible queries are shown to the user. These queries are presented by means of natural language sentences. The user then selects the query he/she is interested in. The query conceptual graph is then built.作者: 向外 時間: 2025-3-23 14:50 作者: 使尷尬 時間: 2025-3-23 20:32
https://doi.org/10.1007/978-3-031-06443-2nalysis (. ) that allows for a thorough reshuffling of the ontology. Here we present a platform for ontology maintenance, ., and illustrate its main workflow dedicated to restructuring. We also report on a preliminary validating study involving several small-to-medium size ontologies.作者: Toxoid-Vaccines 時間: 2025-3-23 22:28
Supporting Ontology Design through Large-Scale FCA-Based Ontology Restructuringnalysis (. ) that allows for a thorough reshuffling of the ontology. Here we present a platform for ontology maintenance, ., and illustrate its main workflow dedicated to restructuring. We also report on a preliminary validating study involving several small-to-medium size ontologies.作者: expunge 時間: 2025-3-24 05:01 作者: 腐蝕 時間: 2025-3-24 09:44
In-Close2, a High Performance Formal Concept Minerporary CbO variant called FCbO. An application of In-Close2 is given, using minimum support to reduce the size and complexity of a large formal context. Based on this application, an analysis of gene expression data is presented. In-Close2 can be downloaded from Sourceforge.作者: Bumptious 時間: 2025-3-24 10:40
Using Generalization of Syntactic Parse Trees for Taxonomy Capture on the Webse trees (syntactic generalization) is applied to form commonalities between various search results for existing entities on the web. Taxonomy and syntactic generalization is applied to relevance improvement in search and text similarity assessment in commercial setting; evaluation results show substantial contribution of both sources.作者: brother 時間: 2025-3-24 16:01 作者: 表主動 時間: 2025-3-24 20:53 作者: 環(huán)形 時間: 2025-3-24 23:18 作者: 能得到 時間: 2025-3-25 03:39
Utilising Encroacher Bush in Animal Feedingimplications—both hazardous and hopeful—of the Most Often Repeated (MOR) assumption, and suggests Peirce’s “economy of research” (EOR), in his evolutionary view of logic, as a promising alternative to MOR for truth-finding in the increasing complexity of crowdsourced knowledge.作者: Fibroid 時間: 2025-3-25 10:49 作者: Resign 時間: 2025-3-25 12:06
https://doi.org/10.1007/978-3-319-03533-8ps to reduce and explore data without prescribing what it is that is searched for from the start. This paper demonstrates the use of FCA for analysing Unix system data with respect to IT security monitoring.作者: Radiation 時間: 2025-3-25 19:19
https://doi.org/10.1007/978-3-030-90700-6 first-order predicate logic. While elaborating on the undecidable variants of the ontology language OWL?2 as our primary examples, we argue that this approach could likewise serve as a role model for knowledge representation formalisms from the Conceptual Structures community.作者: FIG 時間: 2025-3-25 20:16
William M. Lafferty,Oluf Langhellea refinement and extension of more primitive mechanisms of language and reasoning. The concluding section surveys the VivoMind Cognitive Architecture, which builds on and extends the original version presented in the CS book.作者: constitutional 時間: 2025-3-26 00:22 作者: 空中 時間: 2025-3-26 04:23 作者: Congregate 時間: 2025-3-26 11:59 作者: NIP 時間: 2025-3-26 14:49
https://doi.org/10.1007/978-3-031-61810-9 declarative language, designed for representing and reasoning about time-dependent properties. The method is applicable in areas such as ubiquitous computing, allowing the specification of intelligent device behaviour.作者: 廢除 時間: 2025-3-26 19:34
Utility and Feasibility of Reasoning beyond Decidability in Semantic Technologies first-order predicate logic. While elaborating on the undecidable variants of the ontology language OWL?2 as our primary examples, we argue that this approach could likewise serve as a role model for knowledge representation formalisms from the Conceptual Structures community.作者: cunning 時間: 2025-3-26 21:04
Cognitive Architectures for Conceptual Structuresa refinement and extension of more primitive mechanisms of language and reasoning. The concluding section surveys the VivoMind Cognitive Architecture, which builds on and extends the original version presented in the CS book.作者: Traumatic-Grief 時間: 2025-3-27 04:29
A Mapping from Conceptual Graphs to Formal Concept Analysisn. The approach is compared to that of Wille. An example is given of a simple University Transaction Model (TM) scenario that demonstrates how FCA can be applied to CGs, combining the power of each in an integrated and intuitive way.作者: Fillet,Filet 時間: 2025-3-27 08:11
Evaluating the Transaction Graph through a Financial Trading Case Studyand syntactics. The paper demonstrates the reuse and refinement of a generic Transaction Model highlighting inference and logical operations with business rules. Additionally the paper demonstrates the reuse of the automated Transaction Model’s ontology coupled with its conceptual catalogue.作者: 拔出 時間: 2025-3-27 10:06 作者: 聰明 時間: 2025-3-27 16:55
A Modeling Method and Declarative Language for Temporal Reasoning Based on Fluid Qualities declarative language, designed for representing and reasoning about time-dependent properties. The method is applicable in areas such as ubiquitous computing, allowing the specification of intelligent device behaviour.作者: legacy 時間: 2025-3-27 20:15 作者: Vldl379 時間: 2025-3-28 00:34 作者: dendrites 時間: 2025-3-28 05:41
Akinson Tumbure,Sinikiwe Dube,Tonny P. Taurose trees (syntactic generalization) is applied to form commonalities between various search results for existing entities on the web. Taxonomy and syntactic generalization is applied to relevance improvement in search and text similarity assessment in commercial setting; evaluation results show substantial contribution of both sources.作者: 變態(tài) 時間: 2025-3-28 10:15 作者: 廣口瓶 時間: 2025-3-28 14:23
https://doi.org/10.1007/978-3-031-61810-9ide topics, or subtopics. If, at the lowest level, the subject matter of an ontology is characterized by the set of concepts of the ontology, a topic is a “coherent” subset of those concepts. Different forms of modularity induce different, more or less cognitively helpful, notions of coherence and thus distinct topical structures.作者: Interim 時間: 2025-3-28 18:20 作者: Exonerate 時間: 2025-3-28 21:10
Utility and Feasibility of Reasoning beyond Decidability in Semantic Technologies of the standardization process of these and other knowledge representation formalisms, decidability of logical entailment has often been advocated as a central design criterion. On the other hand, restricting to decidable formalisms inevitably comes with constraints in terms of modeling power. Ther作者: Malfunction 時間: 2025-3-29 02:48 作者: 熔巖 時間: 2025-3-29 03:39
In-Close2, a High Performance Formal Concept Minersed and some new optimisation and data preprocessing techniques are presented. The performance of In-Close2 is favourably compared with another contemporary CbO variant called FCbO. An application of In-Close2 is given, using minimum support to reduce the size and complexity of a large formal contex作者: PAGAN 時間: 2025-3-29 09:04
A Mapping from Conceptual Graphs to Formal Concept Analysisd to those of CGs, in, for example, formally reasoning about a system design. In the mapping, a formal attribute in FCA is formed by combining a CG source concept with its relation. The corresponding formal object in FCA is the corresponding CG target concept. It is described how a CG, represented b作者: LUT 時間: 2025-3-29 13:25
Partial Orders and Logical Concept Analysis to Explore Patterns Extracted by Data Mininggeneral, too many resulting patterns for a user to explore them all by hand. Some methods try to reduce the number of patterns without a priori pruning. The number of patterns remains, nevertheless, high. Other approaches, based on a total ranking, propose to show to the user the top-k patterns with作者: 珠寶 時間: 2025-3-29 17:39
A Buzz and E-Reputation Monitoring Tool for Twitter Based on Galois Latticesal networks, by allowing distribution, and therefore broadcasting of information in a almost instantaneous way, also speed up the formation of opinions concerning actuality. Then, these networks are great observatories of opinions and e-reputation. In this e-reputation monitoring task, it is easy to作者: 襲擊 時間: 2025-3-29 23:37
Using Generalization of Syntactic Parse Trees for Taxonomy Capture on the Webn starts from the seed entities and mines the web for new entities associated with them. To form these new entities, machine learning of syntactic parse trees (syntactic generalization) is applied to form commonalities between various search results for existing entities on the web. Taxonomy and syn作者: 比目魚 時間: 2025-3-30 00:54 作者: ornithology 時間: 2025-3-30 04:47
Crowdsourced Knowledge: Peril and Promise for Conceptual Structures Researchrces as a knowledge base. Researchers who develop these systems explicitly assume that what is most often repeated in that knowledge base is the truth. Their assumption implicitly relies on a fallacy in classical logic: “proof by assertion” (or proof by repeated assertion). This paper considers the 作者: 填料 時間: 2025-3-30 10:50 作者: 抵消 時間: 2025-3-30 14:35
Integration of the Controlled Language ACE to the Amine PlatformE Parser Engine or APE) generates a DRS structure (Discourse Representation Structure), we have developed a mapping from DRS to CG (DRS2CG) which produces a CG equivalent to the DRS produced by APE. Through this mapping and this integration of ACE into Amine, Amine users can use controlled language 作者: 閑聊 時間: 2025-3-30 17:40 作者: CRANK 時間: 2025-3-31 00:31
Topicality in Logic-Based Ontologies, a topic is a coherent fragment of the subject matter of the ontology. Different topics may play different roles: e.g., the main topic (or topics), side topics, or subtopics. If, at the lowest level, the subject matter of an ontology is characterized by the set of concepts of the ontology, a topic 作者: GULP 時間: 2025-3-31 01:09
A Concept Discovery Approach for Fighting Human Trafficking and Forced Prostitutionhe European sex industry (estimated 175,000 to 200,000 yearly. In this paper, we present our work with the Amsterdam-Amstelland (Netherlands) police to find suspects and victims of human trafficking and forced prostitution. 266,157 suspicious activity reports were filed by police officers between 20作者: 流逝 時間: 2025-3-31 06:40
A Modeling Method and Declarative Language for Temporal Reasoning Based on Fluid Qualitiesgy modeling languages, such as OWL, have no inherent means for describing time or time-dependent properties. In such settings, time is usually represented along with other application-dependent concepts, yielding complex models that are difficult to maintain, extend, and reason about. On the other h作者: Osteoarthritis 時間: 2025-3-31 12:48
Expressing Conceptual Graph Queries from Patterns: How to Take into Account the Relationsng one to express queries in a very simple pivot language, mainly composed of keywords and relations between keywords. Our system associates the keywords with the corresponding elements of the support (concept types, relation types, individual markers). Then it selects pre-written query patterns, an作者: 多嘴多舌 時間: 2025-3-31 15:41
Unix Systems Monitoring with FCAo detect less severe and more general problems, such as disclosure of sensitive or private data. In theory, security problems could be detected with existing tools, but the amount of information provided is often too overwhelming. FCA is a promising technology in this application area because it hel作者: 使顯得不重要 時間: 2025-3-31 21:13
Supporting Ontology Design through Large-Scale FCA-Based Ontology Restructuringngs. Yet the more complex the structure the less obvious the full impact of such a refactoring. Thus, after a protracted period of maintenance, the overall quality of an ontology may substantially deteriorate. As a remedy, an ontology restructuring task would be performed that cleans its structure a作者: 領導權 時間: 2025-3-31 22:47 作者: harmony 時間: 2025-4-1 02:16
978-3-642-22687-8Springer-Verlag GmbH Berlin Heidelberg 2011作者: Chameleon 時間: 2025-4-1 09:25
Simon Andrews,Simon Polovina,Babak AkhgarFast-track conference proceedings.State-of-the-art research.Up-to-date results作者: AMITY 時間: 2025-4-1 12:15
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/235038.jpg作者: avarice 時間: 2025-4-1 15:40 作者: SIT 時間: 2025-4-1 21:30
