Este documento evalúa el período de Informatica. Resalta que Informatica es una materia excelente que ayuda en el aprendizaje de la tecnología. Sugiere mejorar los implementos de estudio. Describe al profesor como alguien que explica muy bien los temas y tiene una buena actitud. Finalmente, señala que la mayoría de los estudiantes son buenos y respetuosos, pero algunos son habladores e irrespetuosos en clase y otros toman cosas ajenas o dañan la institución.
Prezentacja, dzięki której poznasz szybkie metody tworzenia akcji sprzedażowych bez IT i skomplikowanej technologii. Znajdziesz tu sporo przykładów, które zainspirują Cię do działania.
Este documento describe la vida y logros del químico mexicano Luis Ernesto Miramontes Cárdenas. Nació en 1925 en Tepic, Nayarit, México. En 1951 inventó el primer compuesto activo que fue la base para crear la píldora anticonceptiva oral moderna. Recibió varios premios y reconocimientos por su invención, la cual fue considerada como la contribución mexicana más importante a la ciencia mundial del siglo XX.
El documento presenta los diferentes tipos de energía, incluyendo la energía eléctrica, lumínica, mecánica, térmica, eólica, solar, nuclear, cinética, potencial, química, hidráulica, sonora y radiante. Explica brevemente cada tipo de energía y sus características principales.
IronHacks is a unique, 21-day, 4-stage hacking initiative for hackers who want to create impact through innovation. Participation is free, and you will receive feedback from experts and future app users. You will have the chance to learn from other hackers in the community, gain experience, and turn your ideas into something real!
Este documento evalúa el período de Informatica. Resalta que Informatica es una materia excelente que ayuda en el aprendizaje de la tecnología. Sugiere mejorar los implementos de estudio. Describe al profesor como alguien que explica muy bien los temas y tiene una buena actitud. Finalmente, señala que la mayoría de los estudiantes son buenos y respetuosos, pero algunos son habladores e irrespetuosos en clase y otros toman cosas ajenas o dañan la institución.
Prezentacja, dzięki której poznasz szybkie metody tworzenia akcji sprzedażowych bez IT i skomplikowanej technologii. Znajdziesz tu sporo przykładów, które zainspirują Cię do działania.
Este documento describe la vida y logros del químico mexicano Luis Ernesto Miramontes Cárdenas. Nació en 1925 en Tepic, Nayarit, México. En 1951 inventó el primer compuesto activo que fue la base para crear la píldora anticonceptiva oral moderna. Recibió varios premios y reconocimientos por su invención, la cual fue considerada como la contribución mexicana más importante a la ciencia mundial del siglo XX.
El documento presenta los diferentes tipos de energía, incluyendo la energía eléctrica, lumínica, mecánica, térmica, eólica, solar, nuclear, cinética, potencial, química, hidráulica, sonora y radiante. Explica brevemente cada tipo de energía y sus características principales.
IronHacks is a unique, 21-day, 4-stage hacking initiative for hackers who want to create impact through innovation. Participation is free, and you will receive feedback from experts and future app users. You will have the chance to learn from other hackers in the community, gain experience, and turn your ideas into something real!
Efficient Algorithms for Association Finding and Frequent Association Pattern...Gong Cheng
The document presents efficient algorithms for association finding and frequent association pattern mining in large graph data. It describes the problems of finding all associations connecting a set of query entities within a diameter constraint and mining frequent association patterns. The basic solutions and optimizations for association finding using distance-based pruning and distance oracles are discussed. For frequent pattern mining, it addresses generating a canonical code to uniquely represent patterns and counting code occurrences to determine frequency. Experiments on real datasets demonstrate the efficiency and scalability of the approaches.
Open data and linked open data (LOD) were discussed. LOD involves publishing open data in a linked format using URIs and properties to connect related data. This allows data to be queried and used as a global database. Examples of LOD included DBpedia, which extracts data from Wikipedia and makes it available in multiple languages through SPARQL endpoints. Japanese LOD datasets such as DBpedia Japanese were also presented and can be queried to learn information about topics in Japan.
This document discusses using web tools to aid teaching. The author's goal is to expose teachers to relevant communication and collaboration tools over five days that can help teachers interact with students and families, and engage students through interactive learning materials, teachers, and peers. The author maintains that technology helps with communication and interaction, connecting to students' interests while teaching crucial modern skills, and that practice and time are needed for learning.
Towards Content-Based Dataset Search - Test Collections and BeyondGong Cheng
The document discusses content-based dataset search (CBDS) as an improvement over metadata-based dataset search (MBDS). It presents ACORDAR, a test collection for ad hoc CBDS using synthetic and TREC queries on RDF datasets. Evaluation results showed that both metadata and dataset content are useful, and that TREC queries are more difficult. CBDS faces challenges including scalability, tractability, and heterogeneity, but is likely to trend as it provides higher relevance and explainability than MBDS.
Generating Compact and Relaxable Answers to Keyword Queries over Knowledge Gr...Gong Cheng
This document presents an algorithm called CORE for generating compact yet relaxable answers to keyword queries over knowledge graphs. CORE aims to balance answer compactness, defined as having a bounded diameter, with answer completeness, defined as covering the most query keywords. It provides theoretical foundations for the existence of such answers and uses a best-first search approach. An evaluation shows CORE efficiently computes answers that are more complete than alternatives while remaining compact.
Semantic Data Retrieval: Search, Ranking, and SummarizationGong Cheng
Gong Cheng presented on semantic data retrieval, including entity retrieval and association retrieval from semantic graphs. He discussed two main challenges: efficiently searching large graphs for associations within a diameter bound, and ranking the retrieved associations. For the first challenge, he proposed algorithms using path finding, pruning, and result deduplication. For the second challenge, he conducted a user study and found that association size was the most important ranking factor. Other proposed measures like entity homogeneity and relation heterogeneity had mixed user preferences.
Semantic Web related top conference reviewGong Cheng
The document summarizes key topics in semantic web and knowledge graph research from 2014-2017, including conferences, hot research areas, applications, and papers. It discusses trends such as increasing focus on knowledge graph applications, integration, and construction using techniques like neural networks. Notable news includes Google calling for dataset metadata and Wikidata creating its 31 millionth entity. The road ahead may involve greater knowledge graph commercialization, enrichment, and making knowledge graphs more accessible on the Web.
Efficient Algorithms for Association Finding and Frequent Association Pattern...Gong Cheng
The document presents efficient algorithms for association finding and frequent association pattern mining in large graph data. It describes the problems of finding all associations connecting a set of query entities within a diameter constraint and mining frequent association patterns. The basic solutions and optimizations for association finding using distance-based pruning and distance oracles are discussed. For frequent pattern mining, it addresses generating a canonical code to uniquely represent patterns and counting code occurrences to determine frequency. Experiments on real datasets demonstrate the efficiency and scalability of the approaches.
Open data and linked open data (LOD) were discussed. LOD involves publishing open data in a linked format using URIs and properties to connect related data. This allows data to be queried and used as a global database. Examples of LOD included DBpedia, which extracts data from Wikipedia and makes it available in multiple languages through SPARQL endpoints. Japanese LOD datasets such as DBpedia Japanese were also presented and can be queried to learn information about topics in Japan.
This document discusses using web tools to aid teaching. The author's goal is to expose teachers to relevant communication and collaboration tools over five days that can help teachers interact with students and families, and engage students through interactive learning materials, teachers, and peers. The author maintains that technology helps with communication and interaction, connecting to students' interests while teaching crucial modern skills, and that practice and time are needed for learning.
Towards Content-Based Dataset Search - Test Collections and BeyondGong Cheng
The document discusses content-based dataset search (CBDS) as an improvement over metadata-based dataset search (MBDS). It presents ACORDAR, a test collection for ad hoc CBDS using synthetic and TREC queries on RDF datasets. Evaluation results showed that both metadata and dataset content are useful, and that TREC queries are more difficult. CBDS faces challenges including scalability, tractability, and heterogeneity, but is likely to trend as it provides higher relevance and explainability than MBDS.
Generating Compact and Relaxable Answers to Keyword Queries over Knowledge Gr...Gong Cheng
This document presents an algorithm called CORE for generating compact yet relaxable answers to keyword queries over knowledge graphs. CORE aims to balance answer compactness, defined as having a bounded diameter, with answer completeness, defined as covering the most query keywords. It provides theoretical foundations for the existence of such answers and uses a best-first search approach. An evaluation shows CORE efficiently computes answers that are more complete than alternatives while remaining compact.
Semantic Data Retrieval: Search, Ranking, and SummarizationGong Cheng
Gong Cheng presented on semantic data retrieval, including entity retrieval and association retrieval from semantic graphs. He discussed two main challenges: efficiently searching large graphs for associations within a diameter bound, and ranking the retrieved associations. For the first challenge, he proposed algorithms using path finding, pruning, and result deduplication. For the second challenge, he conducted a user study and found that association size was the most important ranking factor. Other proposed measures like entity homogeneity and relation heterogeneity had mixed user preferences.
Semantic Web related top conference reviewGong Cheng
The document summarizes key topics in semantic web and knowledge graph research from 2014-2017, including conferences, hot research areas, applications, and papers. It discusses trends such as increasing focus on knowledge graph applications, integration, and construction using techniques like neural networks. Notable news includes Google calling for dataset metadata and Wikidata creating its 31 millionth entity. The road ahead may involve greater knowledge graph commercialization, enrichment, and making knowledge graphs more accessible on the Web.
The document proposes a new approach called relatedness-based multi-entity summarization (MES) to generate concise summaries of related entities. It formulates MES as a quadratic multidimensional knapsack problem (QMKP) to select important and diverse intra-entity features while also selecting inter-entity features that indicate relatedness. It presents an algorithm called REMES based on the grasp heuristic to solve the QMKP formulation. A user study shows REMES outperforms other entity summarization methods at multi-entity summarization tasks.
Generating Illustrative Snippets for Open Data on the WebGong Cheng
We propose generating illustrative snippets from datasets to serve with metadata on dataset search engines. Currently, only metadata is shown. Snippets would help users understand the contents faster by covering important types and entities, using familiar entities, and keeping entities related. We formulate the snippet generation as a maximum-weight-and-coverage connected graph problem to optimize for these qualities. Experimental results show our snippets outperform baselines.
This document discusses summarizing semantic data, including entity descriptions, entity associations, and semantic datasets. It describes extractive and abstractive summarization methods. For entity descriptions, intrinsic metrics like frequency, centrality, informativeness, and diversity are used to rank property-value pairs for the summary. Extrinsic metrics also utilize external knowledge and context. Similar methods are applied to summarizing entity associations by ranking paths between entities. Summarizing semantic datasets involves selecting a representative subset of the data.
HIEDS: A Generic and Efficient Approach to Hierarchical Dataset SummarizationGong Cheng
This document summarizes the HIEDS approach to hierarchical dataset summarization. HIEDS aims to provide multigranular summaries that preserve dataset structure and are comprehensible. It models summarization as a multidimensional knapsack problem to maximize subgroup cohesion and moderateness while disallowing large overlap. HIEDS uses a greedy strategy for efficient solving but requires non-trivial implementation. Experiments show HIEDS outperforms the baseline by generating hierarchical rather than flat groups with better trade-offs and less redundancy.
Taking up the Gaokao Challenge: An Information Retrieval ApproachGong Cheng
This document describes an information retrieval approach for answering questions from the Gaokao, China's national college entrance exam. It retrieves relevant concept pages, quotes, and disambiguates terms from Wikipedia. It ranks pages based on centrality within vector spaces of words, links, and categories, filtering within relevant historical categories. It assesses answer options based on the extent the question and pages can entail each option. In experiments, it correctly answered 43.09% of questions answerable from Wikipedia and 31.28% of questions outside Wikipedia's scope.
Summarizing Entity Descriptions for Effective and Efficient Human-centered En...Gong Cheng
Presented at WWW'15, Florence.
Gong Cheng, Danyun Xu, Yuzhong Qu. Summarizing Entity Descriptions for Effective and Efficient Human-centered Entity Linking. In Proceedings of the 24th International World Wide Web Conference (WWW), pages 184--194, 2015.
Explass: Exploring Associations between Entities via Top-K Ontological Patter...Gong Cheng
This document describes Explass, a system for exploring associations between entities via top-k ontological patterns and facets. It discusses challenges in exploring the over 1,000 associations within 4 hops in DBpedia and proposes two exploration methods: clustering associations into patterns and using entity/property classes as facets. The key steps involve mining significant patterns as frequent itemsets and selecting k patterns based on frequency, informativeness, and overlap. A demo of Explass on DBpedia is presented along with results of a user study comparing it to other approaches.
Facilitating Human Intervention in Coreference Resolution with Comparative En...Gong Cheng
The document presents a method for facilitating human intervention in coreference resolution by providing comparative entity summaries. It describes using properties and values of candidate coreferent entities to generate summaries that reflect their commonality and differences. The optimal summary maximizes commonality, difference, identity information and diversity, subject to a length limit. An evaluation involved human subjects verifying coreferent relationships for different summarization approaches. The comparative summary approach was found to improve verification efficiency without affecting accuracy as much as only showing common properties or entire descriptions.
Towards Exploratory Relationship Search: A Clustering-based ApproachGong Cheng
This document presents an approach for exploratory relationship search through hierarchical clustering. It aims to address the challenge of too many relationship search results by organizing them into a cluster hierarchy based on common relationship patterns. An evaluation with participants performing lookup and exploratory search tasks on DBpedia data found that the clustering approach outperformed simple listing and faceted categorization alternatives. User feedback suggested areas for improvement like more concise visualizations and cognitive support. The authors conclude it is a promising approach and future work could combine facets and clustering or explore alternatives.
The document describes the NanJing Vocabulary Repository (NJVR), a freely accessible collection of real-world vocabularies created by crawling over 4 billion RDF triples from thousands of domains. NJVR contains RDF descriptions of over 2,900 vocabularies identified from 261 domains as well as statistical data on their usage. It was constructed through crawling, vocabulary identification, and analysis of vocabulary instantiations. The goal is to provide a large test collection for research on topics like vocabulary ranking and matching.