標(biāo)題: Titlebook: New Frontiers in Mining Complex Patterns; First International Annalisa Appice,Michelangelo Ceci,Zbigniew W. Ras Conference proceedings 201 [打印本頁] 作者: hearken 時間: 2025-3-21 19:11
書目名稱New Frontiers in Mining Complex Patterns影響因子(影響力)
書目名稱New Frontiers in Mining Complex Patterns影響因子(影響力)學(xué)科排名
書目名稱New Frontiers in Mining Complex Patterns網(wǎng)絡(luò)公開度
書目名稱New Frontiers in Mining Complex Patterns網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱New Frontiers in Mining Complex Patterns被引頻次
書目名稱New Frontiers in Mining Complex Patterns被引頻次學(xué)科排名
書目名稱New Frontiers in Mining Complex Patterns年度引用
書目名稱New Frontiers in Mining Complex Patterns年度引用學(xué)科排名
書目名稱New Frontiers in Mining Complex Patterns讀者反饋
書目名稱New Frontiers in Mining Complex Patterns讀者反饋學(xué)科排名
作者: 內(nèi)行 時間: 2025-3-21 20:52
New Frontiers in Mining Complex Patterns978-3-642-37382-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: seroma 時間: 2025-3-22 02:29
Annalisa Appice,Michelangelo Ceci,Zbigniew W. RasHigh quality selected papers.Unique visibility作者: 填料 時間: 2025-3-22 07:44 作者: rectum 時間: 2025-3-22 09:58
https://doi.org/10.1007/978-3-642-37382-4data mining; feature selection; log mining; probabilistic graphs; social web作者: 起皺紋 時間: 2025-3-22 13:11
Erratum: Machine Learning as an Objective Approach to Understanding MusicThe paper starting on page 64 of this publication has been withdrawn because Figure 1 is incorrect and it is unclear if the paper’s results can be reproduced.作者: SSRIS 時間: 2025-3-22 20:47
ntitative graph measures...Structural Analysis of Complex Networks. is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics978-0-8176-4789-6作者: FER 時間: 2025-3-23 00:43 作者: expound 時間: 2025-3-23 02:29
Fabio Leuzzi,Stefano Ferilli,Fulvio Rotellantitative graph measures...Structural Analysis of Complex Networks. is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics978-0-8176-4789-6作者: 玉米 時間: 2025-3-23 06:21
Corrado Loglisci,Michelangelo Ceci,Donato Malerbantitative graph measures...Structural Analysis of Complex Networks. is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics978-0-8176-4789-6作者: Wallow 時間: 2025-3-23 09:50
Francesco Folino,Massimo Guarascio,Luigi Pontierintitative graph measures...Structural Analysis of Complex Networks. is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics978-0-8176-4789-6作者: 膠狀 時間: 2025-3-23 15:24 作者: Misnomer 時間: 2025-3-23 20:40 作者: Dedication 時間: 2025-3-23 22:34 作者: Kinetic 時間: 2025-3-24 06:08 作者: 西瓜 時間: 2025-3-24 09:52 作者: 退潮 時間: 2025-3-24 14:39
Ayman Hajja,Alicja A. Wieczorkowska,Zbigniew W. Ras,Ryszard Gubrynowiczmeasures for graphs; metrical properties of graphs; partitions and decompositions; and?quantitative graph measures...Structural Analysis of Complex Networks. is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics作者: Factual 時間: 2025-3-24 15:29
Elias Egho,Chedy Ra?ssi,Dino Ienco,Nicolas Jay,Amedeo Napoli,Pascal Poncelet,Catherine Quantin,Maguemeasures for graphs; metrical properties of graphs; partitions and decompositions; and?quantitative graph measures...Structural Analysis of Complex Networks. is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics作者: Limited 時間: 2025-3-24 22:16
Mohamed Khalil El Mahrsi,Fabrice Rossimeasures for graphs; metrical properties of graphs; partitions and decompositions; and?quantitative graph measures...Structural Analysis of Complex Networks. is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics作者: Insulin 時間: 2025-3-25 01:34
Michael Davis,Weiru Liu,Paul Millermeasures for graphs; metrical properties of graphs; partitions and decompositions; and?quantitative graph measures...Structural Analysis of Complex Networks. is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics作者: maculated 時間: 2025-3-25 06:41 作者: 吃掉 時間: 2025-3-25 08:48
Francesco Buccafurri,Gianluca Lax,Antonino Nocera,Domenico Ursinomeasures for graphs; metrical properties of graphs; partitions and decompositions; and?quantitative graph measures...Structural Analysis of Complex Networks. is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics作者: Nausea 時間: 2025-3-25 15:16
Claire Q,Ross D. Kingmeasures for graphs; metrical properties of graphs; partitions and decompositions; and?quantitative graph measures...Structural Analysis of Complex Networks. is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics作者: Atheroma 時間: 2025-3-25 18:07
damping and mass terms of the cross-section. In the fourth subsection, building upon the damping mechanics, an extended beam finite element is developed capable of providing the stiffness and damping matrices of the structure, which contain new material coupling terms, essential for describing the 作者: 排他 時間: 2025-3-25 19:59
Learning in the Presence of Large Fluctuations: A Study of Aggregation and Correlationding on the stability exponent of the Lévy distribution. Our results indicate that the correlation in between two attributes may be underestimated if a Gaussian distribution is erroneously assumed. Secondly, we show that, in the scenario where we aim to learn a set of rules to estimate the level of 作者: companion 時間: 2025-3-26 00:50
Retracted: Machine Learning as an Objective Approach to Understanding Musicctions: a land and sea mask, and a population distribution overlay. The best-performing prediction method achieved a median land distance error of 1,506km, with comparable random trials having mean of medians 3,190km - this is significant at P < 0.001.作者: Sputum 時間: 2025-3-26 04:18
Pair-Based Object-Driven Action Rulesor temporal and object-driven systems. The focus of this paper will be on our proposed pair-based approach, along with the modifications required to extract action rules and calculate their properties.作者: 拉開這車床 時間: 2025-3-26 12:05
Effectively Grouping Trajectory Streamsting from data preparation task that allows us to make the mining step quite effective. Since the validation of data mining approaches has to be experimental we performed several tests on real world datasets that confirmed the efficiency and effectiveness of the proposed technique.作者: prediabetes 時間: 2025-3-26 14:48 作者: deadlock 時間: 2025-3-26 17:38
Improving Robustness and Flexibility of Concept Taxonomy Learning from Texterent kinds of relationships among concepts, where each arc/relationship is associated to a weight that represents its likelihood among all ., and to face the problem of sparse knowledge by using generalizations among distant concepts as bridges between disjoint portions of knowledge.作者: 鞠躬 時間: 2025-3-26 22:04 作者: 展覽 時間: 2025-3-27 04:38
Reducing Examples in Relational Learning with Bounded-Treewidth Hypothesesorm of clauses can be reduced in size to speed up learning .. To this end, we introduce the notion of safe reduction: a safely reduced example cannot be distinguished from the original example .. Next, we consider the particular, rather permissive bias of bounded treewidth clauses. We show that unde作者: 遭受 時間: 2025-3-27 07:47 作者: 哀求 時間: 2025-3-27 09:35
Learning in the Presence of Large Fluctuations: A Study of Aggregation and Correlation outliers. This may be the case, for instance, when predicting the potential future damages of earthquakes or oil spills, or when conducting financial data analysis. If follows that, in such a situation, the standard central limit theorem does not apply, since the associated Gaussian distribution ex作者: FACET 時間: 2025-3-27 15:26
Retracted: Machine Learning as an Objective Approach to Understanding Musicon the use of objective machine learning programs. To illustrate this methodology we investigated the distribution of music from around the world: geographical ethnomusicology. To ensure that the knowledge obtained about geographical ethnomusicology is objective and operational we cast the problem a作者: Acumen 時間: 2025-3-27 20:11 作者: Mingle 時間: 2025-3-28 00:43 作者: gangrene 時間: 2025-3-28 04:59 作者: 谷類 時間: 2025-3-28 09:15
Graph-Based Approaches to Clustering Network-Constrained Trajectory Datan euclidean space and did not consider the eventual presence of an underlying road network and its influence on evaluating the similarity between trajectories. In this paper, we present an approach to clustering such network-constrained trajectory data. More precisely we aim at discovering groups of作者: Lucubrate 時間: 2025-3-28 12:43
Finding the Most Descriptive Substructures in Graphs with Discrete and Numeric Labelsn this paper we show that they can be used to improve discrimination and search performance. Our thesis is that the most descriptive substructures are those which are normative both in terms of their structure and in terms of their numeric values. We explore the relationship between graph structure 作者: 充氣球 時間: 2025-3-28 14:58
Learning in Probabilistic Graphs Exploiting Language-Constrained Patternskelihood of the edge existence or the strength of the link it represents. The goal of this paper is to provide a learning method to compute the most likely relationship between two nodes in a framework based on probabilistic graphs. In particular, given a probabilistic graph we adopted the language-作者: 討人喜歡 時間: 2025-3-28 21:20
Improving Robustness and Flexibility of Concept Taxonomy Learning from Textability of conceptual taxonomies can be of great help, but manually building them is a complex and costly task. Building on previous work, we propose a technique to automatically extract conceptual graphs from text and reason with them. Since automated learning of taxonomies needs to be robust with 作者: Promotion 時間: 2025-3-28 23:10
Discovering Evolution Chains in Dynamic Networks is dynamic, i.e. nodes/relationships can be added or removed and relationships can change in their type over time. We assume that the “core” of the network is more stable than the “marginal” part of the network, nevertheless it can change with time. These changes are of interest for this work, sinc作者: Folklore 時間: 2025-3-29 05:46
Supporting Information Spread in a Social Internetworking Scenarioty. This problem has been widely studied in the recent literature and is still open, but it becomes even more challenging, due to the new issues to deal with, in a multi-social-network context, where the possibility that information can cross different social networks has a fundamental role. As a ma作者: ANT 時間: 2025-3-29 07:42
Context-Aware Predictions on Business Processes: An Ensemble-Based Solutionexible processes, whose behaviour tend to change over time depending on context factors. We try to face such a situation by proposing a predictive-clustering approach, where different context-related execution scenarios are equipped with separate prediction models. Recent methods for the discovery o作者: 影響帶來 時間: 2025-3-29 15:14 作者: Sad570 時間: 2025-3-29 18:50
Fernando Martínez-Plumed,Cèsar Ferri,José Hernández-Orallo,María José Ramírez-Quintanaficult procedure. As a result, there is a strong need to combine graph-theoretic methods with mathematical techniques from other scientific disciplines, such as machine learning and information theory, in order to analyze complex networks more adequately...Filling a gap in literature, this self-cont作者: 良心 時間: 2025-3-29 23:34 作者: 排出 時間: 2025-3-30 02:25 作者: 大罵 時間: 2025-3-30 05:53 作者: 易受刺激 時間: 2025-3-30 09:23
Claire Q,Ross D. Kingficult procedure. As a result, there is a strong need to combine graph-theoretic methods with mathematical techniques from other scientific disciplines, such as machine learning and information theory, in order to analyze complex networks more adequately...Filling a gap in literature, this self-cont作者: DEMUR 時間: 2025-3-30 15:47 作者: 教唆 時間: 2025-3-30 20:37 作者: 樹木心 時間: 2025-3-30 21:24
Elias Egho,Chedy Ra?ssi,Dino Ienco,Nicolas Jay,Amedeo Napoli,Pascal Poncelet,Catherine Quantin,Magueficult procedure. As a result, there is a strong need to combine graph-theoretic methods with mathematical techniques from other scientific disciplines, such as machine learning and information theory, in order to analyze complex networks more adequately...Filling a gap in literature, this self-cont作者: Nuance 時間: 2025-3-31 01:13 作者: 圓桶 時間: 2025-3-31 08:41
Michael Davis,Weiru Liu,Paul Millerficult procedure. As a result, there is a strong need to combine graph-theoretic methods with mathematical techniques from other scientific disciplines, such as machine learning and information theory, in order to analyze complex networks more adequately...Filling a gap in literature, this self-cont作者: Monocle 時間: 2025-3-31 09:25
Claudio Taranto,Nicola Di Mauro,Floriana Espositoficult procedure. As a result, there is a strong need to combine graph-theoretic methods with mathematical techniques from other scientific disciplines, such as machine learning and information theory, in order to analyze complex networks more adequately...Filling a gap in literature, this self-cont作者: institute 時間: 2025-3-31 17:19
Fabio Leuzzi,Stefano Ferilli,Fulvio Rotella interdisciplinary readership of researchers, practitioners,.Because of the increasing complexity and growth of real-world networks, their analysis by using classical graph-theoretic methods is oftentimes a difficult procedure. As a result, there is a strong need to combine graph-theoretic methods w作者: Corral 時間: 2025-3-31 20:35 作者: impaction 時間: 2025-3-31 21:42 作者: podiatrist 時間: 2025-4-1 05:16 作者: 起來了 時間: 2025-4-1 07:03 作者: thwart 時間: 2025-4-1 10:43 作者: 共和國 時間: 2025-4-1 16:37
Discovering Evolution Chains in Dynamic Networksthat the frequency of a pattern is computed along a time-period and not on a static dataset. The proposed method proceeds in two steps: 1) identification of changes through the discovery of emerging patterns; 2) composition of evolution chains by joining emerging patterns. We test the effectiveness of the method on both real and synthetic data.作者: Infantry 時間: 2025-4-1 22:28
