Готові списки джерел за темами / Stratified graph

Зміст

Статті в журналах
Дисертації
Частини книг
Тези доповідей конференцій

Добірка наукової літератури з теми "Stratified graph"

Автор: Grafiati

Опубліковано: 3 червня 2025

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Stratified graph".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Stratified graph"

Ji, Yuwen, Lei Shi, Zhimeng Liu, and Ge Wang. "Stratified GNN Explanations through Sufficient Expansion." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 11 (2024): 12839–47. http://dx.doi.org/10.1609/aaai.v38i11.29180.

Повний текст джерела

Анотація:

Explaining the decisions made by Graph Neural Networks (GNNs) is vital for establishing trust and ensuring fairness in critical applications such as medicine and science. The prevalence of hierarchical structure in real-world graphs/networks raises an important question on GNN interpretability: "On each level of the graph structure, which specific fraction imposes the highest influence over the prediction?" Currently, the prevailing two categories of methods are incapable of achieving multi-level GNN explanation due to their flat or motif-centric nature. In this work, we formulate the problem

Стилі APA, Harvard, Vancouver, ISO та ін.

Guo, Jin, and Tongsuo Wu. "Graph Properties and Stratified Presentations of Partially Ordered Sets." Algebra Colloquium 23, no. 01 (2016): 51–63. http://dx.doi.org/10.1142/s1005386716000079.

Повний текст джерела

Анотація:

In this paper, we introduce some new definitions such as the U* L* condition to describe the zero-divisor graph G=Γ(P) of a poset P, and give a new and quick proof to a main result in [2, 4]. By deleting a typical vertex with least degree, we provide an algorithm for finding a maximum clique of a finite graph G. We study some properties of the zero-divisor graphs of posets concerning diameters and girths. We also provide stratified presentations of posets.

Стилі APA, Harvard, Vancouver, ISO та ін.

Dănciulescu, Dana, and Mihaela Colhon. "Splitting the structured paths in stratified graphs. Application in Natural Language Generation." Analele Universitatii "Ovidius" Constanta - Seria Matematica 22, no. 2 (2014): 57–68. http://dx.doi.org/10.2478/auom-2014-0031.

Повний текст джерела

Анотація:

AbstractThe concept of labeled stratified graph (LSG) introduces some method of knowledge representation. The inference process developed for this structures uses the paths of the stratified graphs, an order between the elementary arcs of a path and some results of universal algebras. The order is defined by considering a structured path instead of a regular path. The application described in this paper interprets the symbolic elements of a LSG with natural language constructions. In this manner we obtained a mechanism for generation coherent texts in a natural language (for this approach, Rom

Стилі APA, Harvard, Vancouver, ISO та ін.

DANCIULESCU, DANIELA, and MIHAELA COLHON. "Systems of knowledge representation based on stratified graphs. Application in Natural Language Generation." Carpathian Journal of Mathematics 32, no. 1 (2016): 49–62. http://dx.doi.org/10.37193/cjm.2016.01.05.

Повний текст джерела

Анотація:

The concept of stratified graph introduces some method of knowledge representation (see [T¸ and ˘ areanu, N., ˘ Knowledge representation by labeled stratified graphs, Proc. 8th World Multi-Conference on Systemics, Cybernetics and Informatics, 5 (2004), 345–350; T¸ and ˘ areanu, N., ˘ Proving the Existence of Labelled Stratified Graphs, An. Univ. Craiova Ser. Mat. Inform., 27 (2000), 81–92]) The inference process developed for this method uses the paths of the stratified graphs, an order between the elementary arcs of a path and some results of universal algebras. The order is defined by consid

Стилі APA, Harvard, Vancouver, ISO та ін.

Daniela, Dănciulescu, Colhon Mihaela, and Grigoraş Gheorghe. "BRAIN Journal - Right-Linear Languages Generated in Systems of Knowledge Representation based on LSG." BRAIN - Broad Research in Artificial Intelligence and Neuroscience 8, no. 1 (2017): 42–51. https://doi.org/10.5281/zenodo.1045027.

Повний текст джерела

Анотація:

ABSTRACT In Tudor (Preda) (2010) a method for formal languages generation based on labeled stratified graph representations is sketched. The author proves that the considered method can generate regular languages and context-sensitive languages by considering an exemplification of the proposed method for a particular regular language and another one for a particular contextsensitive language. At the end of the study, the author highlights some open problems for future research among which we remind: (1) The study of the language families that can be generated by means of these structures; (2)

Стилі APA, Harvard, Vancouver, ISO та ін.

Kairatkyzy, Agnur, Lyailya Zhapsarbayeva, Agila Tleulessova, Symbat Kabdrakhova, and Saule Burgumbayeva. "RECONSTRUCTION THE DOMAIN OF DEFINITION OF SOMEDIFFERENTIAL OPERATOR ON A DIRECTED GRAPH." Journal of Mathematics, Mechanics and Computer Science 123, no. 3 (2024): 3–14. http://dx.doi.org/10.26577/jmmcs2024-v123-i3-1.

Повний текст джерела

Анотація:

In this work it is proposed to study differential operators on a graph as an operator composed of differential operators on one-dimensional arcs and matrix operators on interior vertices of the graph. The work explores some questions concerning the theoretical side of ordinary differential equations with integro-differential conditions on stratified sets like graph. The attention will be paid to reconstruction of the domain of differential operator on directed graph. The reconstruction of the domain of differential operator means a simple specifying the boundary conditions from a known differe

Стилі APA, Harvard, Vancouver, ISO та ін.

Streib, Amanda, Noah Streib, Isabel Beichl, and Francis Sullivan. "Stratified sampling for the Ising model: A graph-theoretic approach." Computer Physics Communications 191 (June 2015): 1–8. http://dx.doi.org/10.1016/j.cpc.2015.01.005.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

COSTANTINI, STEFANIA. "On the existence of stable models of non-stratified logic programs." Theory and Practice of Logic Programming 6, no. 1-2 (2006): 169–212. http://dx.doi.org/10.1017/s1471068405002589.

Повний текст джерела

Анотація:

In this paper we analyze the relationship between cyclic definitions and consistency in Gelfond-Lifschitz's answer sets semantics (originally defined as ‘stable model semantics’). This paper introduces a fundamental result, which is relevant for Answer Set programming, and planning. For the first time since the definition of the stable model semantics, the class of logic programs for which a stable model exists is given a syntactic characterization. This condition may have a practical importance both for defining new algorithms for checking consistency and computing answer sets, and for improv

Стилі APA, Harvard, Vancouver, ISO та ін.

Chartrand, Gary, Donald W. Vanderjagt, and Ping Zhang. "Homogeneously embedding stratified graphs in stratified graphs." Mathematica Bohemica 130, no. 1 (2005): 35–48. http://dx.doi.org/10.21136/mb.2005.134221.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wang, Chenming, and Bo Huang. "The Use of Attentive Knowledge Graph Perceptual Propagation for Improving Recommendations." Applied Sciences 13, no. 8 (2023): 4667. http://dx.doi.org/10.3390/app13084667.

Повний текст джерела

Анотація:

Collaborative filtering (CF) usually suffers from data sparsity and cold starts. Knowledge graphs (KGs) are widely used to improve recommendation performance. To verify that knowledge graphs can further alleviate the above problems, this paper proposes an end-to-end framework that uses attentive knowledge graph perceptual propagation for recommendations (AKGP). This framework uses a knowledge graph as a source of auxiliary information to extract user–item interaction information and build a sub-knowledge base. The fusion of structural and contextual information is used to construct fine-graine

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Stratified graph"

CARLI, FEDERICO. "Stratified Staged Trees: Modelling, Software and Applications." Doctoral thesis, Università degli studi di Genova, 2021. http://hdl.handle.net/11567/1057653.

Повний текст джерела

Анотація:

The thesis is focused on Probabilistic Graphical Models (PGMs), which are a rich framework for encoding probability distributions over complex domains. In particular, joint multivariate distributions over large numbers of random variables that interact with each other can be investigated through PGMs and conditional independence statements can be succinctly represented with graphical representations. These representations sit at the intersection of statistics and computer science, relying on concepts mainly from probability theory, graph algorithms and machine learning. They are applied in a w

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Stratified graph"

Zhu, Junpeng, Hui Li, Mei Chen, Zhenyu Dai, and Ming Zhu. "Enhancing Stratified Graph Sampling Algorithms Based on Approximate Degree Distribution." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-91189-2_20.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Chartrand, Gary, and Ping Zhang. "Stratified Domination." In Topics in Domination in Graphs. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51117-3_14.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Shenvi, Aditi, Jim Q. Smith, Robert Walton, and Sandra Eldridge. "Modelling with Non-stratified Chain Event Graphs." In Springer Proceedings in Mathematics & Statistics. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-30611-3_16.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ahmetaj, Shqiponja, Magdalena Ortiz, Anouk Oudshoorn, and Mantas Šimkus. "Reconciling SHACL and Ontologies: Semantics and Validation via Rewriting." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2023. http://dx.doi.org/10.3233/faia230250.

Повний текст джерела

Анотація:

OWL and SHACL are two prominent W3C standards for managing RDF graphs, the data model of the Web. They are used for different purposes and make different assumptions about the completeness of data: SHACL is used for expressing integrity constraints on complete data, while OWL allows inferring implicit facts from incomplete data; SHACL reasoners perform validation, while OWL reasoners do logical inference. Integrating these two tasks into one uniform approach is a relevant but challenging problem. The SHACL standard envisions graph validation in combination with OWL entailment, but it does not

Стилі APA, Harvard, Vancouver, ISO та ін.

Arenas, Marcelo, Georg Gottlob, and Andreas Pieris. "Querying the Semantic Web via Rules." In Applications and Practices in Ontology Design, Extraction, and Reasoning. IOS Press, 2020. http://dx.doi.org/10.3233/ssw200044.

Повний текст джерела

Анотація:

The problem of querying RDF data is a central issue for the development of the Semantic Web. The query language SPARQL has become the standard language for querying RDF since its W3C standardization in 2008. However, the 2008 version of this language missed some important functionalities: reasoning capabilities to deal with RDFS and OWL vocabularies, navigational capabilities to exploit the graph structure of RDF data, and a general form of recursion much needed to express some natural queries. To overcome those limitations, a new version of SPARQL, called SPARQL 1.1, was released in 2013, whi

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Stratified graph"

Ivliev, Alex, Lukas Gerlach, Simon Meusel, Jakob Steinberg, and Markus Krötzsch. "Nemo: Your Friendly and Versatile Rule Reasoning Toolkit." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/70.

Повний текст джерела

Анотація:

We present Nemo, a toolkit for rule-based reasoning and data processing that emphasises robustness and ease of use. Nemo’s core is a scalable and efficient main-memory reasoner that supports an expressive extension of Datalog with support for datatypes, existential rules, aggregates, and (stratified) negation. Built around this core is a versatile system of libraries and applications for interfacing with several data formats and programming languages, use as a progressive web application, and IDE integration. In this system description, we present this toolkit and discuss relevant application

Стилі APA, Harvard, Vancouver, ISO та ін.

Jamil, Hasan M., and Carlos R. Rivero. "A novel model for distributed big data service composition using stratified functional graph matching." In WIMS '17: 7th International Conference on Web Intelligence, Mining and Semantics. ACM, 2017. http://dx.doi.org/10.1145/3102254.3102281.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Rivera, Grecia C. G., Juan G. Colonna, and Marcelo Ruiz. "Discovery of Conditionally Independent Networks Among Gene Expressions in Breast Cancer Using Fast Step Graph." In Simpósio Brasileiro de Computação Aplicada à Saúde. Sociedade Brasileira de Computação - SBC, 2025. https://doi.org/10.5753/sbcas.2025.7499.

Повний текст джерела

Анотація:

The heterogeneity of the causes of breast cancer and these complex gene interactions that characterize this neoplasm present significant challenges to understanding and treating the disease. This study is motivated by the need to identify interconnected networks of breast cancer genes, specifically those that represent conditional independence relationships. To construct these networks, we propose the use of the Fast Step Graph algorithm, which belongs to the family of sparse, high-dimensional Gaussian Graphical Models, applied to the PAM50 gene expression dataset. This dataset was stratified

Стилі APA, Harvard, Vancouver, ISO та ін.

Monko, Gloriana Joseph, and Masaomi Kimura. "Optimized DBSCAN Parameter Selection: Stratified Sampling for Epsilon and Gridsearch for Minimum Samples." In 2nd International Conference on Software Engineering and Automation. Academy & Industry Research Collaboration Center, 2023. http://dx.doi.org/10.5121/csit.2023.132004.

Повний текст джерела

Анотація:

This research presents an advanced methodology for estimating the epsilon and minimum samples parameters in the DBSCAN clustering algorithm using a Stratified Sampling and Grid-Search approach. Our method showcased notable improvement in eps estimation precision across nine diverse datasets compared to conventional techniques. By accounting for dataset variations in structure and density, stratified sampling leads to superior cluster formations. The k-nearest distance graph further refines these relationships, ensuring a comprehensive understanding of data densities. Additionally, our method u

Стилі APA, Harvard, Vancouver, ISO та ін.

Viggiano, Annarita, and Vinicio Magi. "Numerical Simulations of an Ethanol Partially Stratified Charge CI Engine With Adaptively Reduced Kinetic Mechanisms." In ASME 2012 Internal Combustion Engine Division Spring Technical Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/ices2012-81104.

Повний текст джерела

Анотація:

This work deals with the analysis of the performance and emissions of ethanol HCCI/PSCCI engines by means of a Dynamic Adaptive Chemistry (DAC) technique. The implementation of such a technique provides a reduction of the computational cost of the simulations without compromising the reliability of the results. Very accurate results, in terms of pressure and heat release rate profiles and CO, CO2 and UHC emissions, are obtained with ethanol as the only species for the DRGEP graph search both with the charge uniformly distributed in the combustion chamber and by directly injecting liquid fuel i

Стилі APA, Harvard, Vancouver, ISO та ін.

Minkov, Dorian, and Ryno Swanepoel. "Comparative study of the use of the matrix approach and the flow-graph approach for optical analysis of isotropic stratified planar structures." In SPIE's 1995 International Symposium on Optical Science, Engineering, and Instrumentation, edited by Robert E. Fischer and Warren J. Smith. SPIE, 1995. http://dx.doi.org/10.1117/12.219524.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

"Stratified space learning: Reconstructing embedded graphs." In 23rd International Congress on Modelling and Simulation (MODSIM2019). Modelling and Simulation Society of Australia and New Zealand, 2019. http://dx.doi.org/10.36334/modsim.2019.a3.bokor.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Alviano, Mario. "Answer Set Programming with Composed Predicate Names." In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/5.

Повний текст джерела

Анотація:

Mainstream systems for Answer Set Programming implement intelligent grounding to eliminate object variables from the input program, often obtaining a propositional program of reasonable size. However, non-stratified negation may inhibit the simplification of some rule bodies due to the lack of knowledge on the truth of recursive atoms. Frustration is greatest when the program is clearly locally stratified, such as in case of numerical arguments in rule heads obtained by increasing some body arguments; common examples are minimal distances in graphs and time arguments in planning scenarios. Thi

Стилі APA, Harvard, Vancouver, ISO та ін.

Tandareanu, N., and M. Ghindeanu. "Hierarchical reasoning based on stratified graphs application in image synthesis." In Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004. IEEE, 2004. http://dx.doi.org/10.1109/dexa.2004.1333524.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Negru, Viorel, Gheorghe Grigoraş, and Daniela Dănciulescu. "Natural Language Agreement in the Generation Mechanism based on Stratified Graphs." In BCI '15: 7th Balkan Conference in Informatics. ACM, 2015. http://dx.doi.org/10.1145/2801081.2801121.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!