標(biāo)題: Titlebook: Discovery Science; 15th International C Jean-Gabriel Ganascia,Philippe Lenca,Jean-Marc Pet Conference proceedings 2012 Springer-Verlag Berl [打印本頁] 作者: 稀少 時(shí)間: 2025-3-21 16:38
書目名稱Discovery Science影響因子(影響力)
書目名稱Discovery Science影響因子(影響力)學(xué)科排名
書目名稱Discovery Science網(wǎng)絡(luò)公開度
書目名稱Discovery Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Discovery Science被引頻次
書目名稱Discovery Science被引頻次學(xué)科排名
書目名稱Discovery Science年度引用
書目名稱Discovery Science年度引用學(xué)科排名
書目名稱Discovery Science讀者反饋
書目名稱Discovery Science讀者反饋學(xué)科排名
作者: 不如屎殼郎 時(shí)間: 2025-3-21 23:45
Recent Developments in Pattern Miningquent itemsets have been proposed. These exhaustive algorithms, however, all suffer from the pattern explosion problem. Depending on the minimal support threshold, even for moderately sized databases, millions of patterns may be generated. Although this problem is by now well recognized in te patter作者: 同音 時(shí)間: 2025-3-22 02:15 作者: stratum-corneum 時(shí)間: 2025-3-22 05:21
Large Scale Spectral Clustering Using Resistance Distance and Spielman-Teng Solverse price for this promise is the computational cost .(..) for computing the eigen-decomposition of the graph Laplacian matrix - so far a necessary subroutine for spectral clustering. In this paper we bypass the eigen-decomposition of the original Laplacian matrix by leveraging the recently introduced作者: COMA 時(shí)間: 2025-3-22 09:49
Prediction of Quantiles by Statistical Learning and Application to GDP Forecastingnctions. In a first time, we show that the Gibbs estimator is able to predict as well as the best predictor in a given family for a wide set of loss functions. In particular, using the quantile loss function of [1], this allows to build confidence intervals. We apply these results to the problem of 作者: Robust 時(shí)間: 2025-3-22 15:41
Policy Search in a Space of Simple Closed-form Formulas: Towards Interpretability of Reinforcement Llgorithm over a space of simple closed-form formulas that are used to rank actions. We formalize the search for a high-performance policy as a multi-armed bandit problem where each arm corresponds to a candidate policy canonically represented by its shortest formula-based representation. Experiments作者: Robust 時(shí)間: 2025-3-22 17:46
Towards Finding Relational Redescriptionstional dataset. By extending redescription mining beyond propositional and real-valued attributes, it provides a powerful tool to match different relational descriptions of the same concept. As a first step towards solving this general task, we introduce an efficient algorithm that mines one descrip作者: CRP743 時(shí)間: 2025-3-22 22:06 作者: 自愛 時(shí)間: 2025-3-23 01:51
A Trim Distance between Positions in Nucleotide Sequencesg the indices of nucleotide sequences as labels of leaves with the nucleotides occurring in a position, we formulate a . between two positions in nucleotide sequences as the LCA-preserving distance between the trimmed phylogenetic trees according to nucleotides occurring in the positions. Finally, w作者: gastritis 時(shí)間: 2025-3-23 05:39
Data Squashing for HSV Subimages by an Autonomous Mobile Robotakes during a navigation of dozens of minutes. The subimages are managed according to a similarity measure between a pair of subimages, which is based on a method for quantizing HSV colors. The data index structure has been inspired by the CF tree of BIRCH, which is an early work in data squashing, 作者: GLUE 時(shí)間: 2025-3-23 10:56 作者: 名次后綴 時(shí)間: 2025-3-23 15:25 作者: custody 時(shí)間: 2025-3-23 21:49
HCAC: Semi-supervised Hierarchical Clustering Using Confidence-Based Active Learningmi-supervised hierarchical clustering by using an active learning solution with cluster-level constraints. This active learning approach is based on a new concept of merge confidence in agglomerative clustering. When there is low confidence in a cluster merge the user is queried and provides a clust作者: NIB 時(shí)間: 2025-3-24 02:01
LF-CARS: A Loose Fragment-Based Consensus Clustering Algorithm with a Robust Similaritying result from multiple data sources or to improve the robustness of clustering result. In this paper, we propose a novel definition of the similarity between points and clusters to represent how a point should join or leave a cluster clearly. With this definition of similarity, we desigh an iterat作者: Radiation 時(shí)間: 2025-3-24 04:19 作者: Climate 時(shí)間: 2025-3-24 10:22
Online Co-regularized Algorithmsediction functions on unlabeled data points, our algorithm provides improved performance in comparison to supervised methods on several UCI benchmarks and a real world natural language processing dataset. The presented algorithm is particularly applicable to learning tasks where large amounts of (un作者: SPALL 時(shí)間: 2025-3-24 11:57
Fast Progressive Training of Mixture Models for Model Selectionaging, and handling missing data. One of the prerequisites of using mixture models is the a priori knowledge of the number of mixture components so that the Expectation Maximization (EM) algorithm can learn the maximum likelihood parameters of the mixture model. However, the number of mixing compone作者: Androgen 時(shí)間: 2025-3-24 16:05 作者: 游行 時(shí)間: 2025-3-24 20:34 作者: 參考書目 時(shí)間: 2025-3-25 01:25
Thomas Zumbroich,Andreas Müllere learning or data mining techniques. This is because machine learning and data mining have focussed on developing high-performance algorithms for solving particular tasks rather than on developing general principles and techniques. I propose to alleviate these problems by applying the constraint pr作者: 無法解釋 時(shí)間: 2025-3-25 04:21
Das Verfahren der Gew?sserstrukturkartierungquent itemsets have been proposed. These exhaustive algorithms, however, all suffer from the pattern explosion problem. Depending on the minimal support threshold, even for moderately sized databases, millions of patterns may be generated. Although this problem is by now well recognized in te patter作者: 愛社交 時(shí)間: 2025-3-25 08:51 作者: 完成才會(huì)征服 時(shí)間: 2025-3-25 14:39
Strukturpolitik Aufgabe der achtziger Jahree price for this promise is the computational cost .(..) for computing the eigen-decomposition of the graph Laplacian matrix - so far a necessary subroutine for spectral clustering. In this paper we bypass the eigen-decomposition of the original Laplacian matrix by leveraging the recently introduced作者: Glucocorticoids 時(shí)間: 2025-3-25 18:53
Instrumente der Strukturpolitiknctions. In a first time, we show that the Gibbs estimator is able to predict as well as the best predictor in a given family for a wide set of loss functions. In particular, using the quantile loss function of [1], this allows to build confidence intervals. We apply these results to the problem of 作者: 碎石頭 時(shí)間: 2025-3-25 23:55 作者: 擔(dān)憂 時(shí)間: 2025-3-26 00:55 作者: IRS 時(shí)間: 2025-3-26 04:42 作者: Crohns-disease 時(shí)間: 2025-3-26 11:59
Wolfgang Stegmüller,Matthias Varga von Kibédg the indices of nucleotide sequences as labels of leaves with the nucleotides occurring in a position, we formulate a . between two positions in nucleotide sequences as the LCA-preserving distance between the trimmed phylogenetic trees according to nucleotides occurring in the positions. Finally, w作者: 喃喃而言 時(shí)間: 2025-3-26 14:27 作者: 合適 時(shí)間: 2025-3-26 17:03 作者: 河潭 時(shí)間: 2025-3-27 00:57 作者: FOR 時(shí)間: 2025-3-27 01:09 作者: 加強(qiáng)防衛(wèi) 時(shí)間: 2025-3-27 05:40
Strukturwandel internationaler Beziehungening result from multiple data sources or to improve the robustness of clustering result. In this paper, we propose a novel definition of the similarity between points and clusters to represent how a point should join or leave a cluster clearly. With this definition of similarity, we desigh an iterat作者: blackout 時(shí)間: 2025-3-27 11:43
Strukturwandel internationaler Beziehungen node ., our algorithm repeatedly finds a better node by making use of a shortest path tree of the previous node. We empirically show that our algorithm runs much faster and has better approximation ratio than a sophisticated existing method called DTZ. We demonstrate the effectiveness of our algori作者: Watemelon 時(shí)間: 2025-3-27 13:44 作者: 饒舌的人 時(shí)間: 2025-3-27 20:21 作者: BARGE 時(shí)間: 2025-3-28 00:29 作者: Decimate 時(shí)間: 2025-3-28 04:47 作者: 排他 時(shí)間: 2025-3-28 08:37 作者: 未開化 時(shí)間: 2025-3-28 10:42
Strukturwandel internationaler Beziehungen node ., our algorithm repeatedly finds a better node by making use of a shortest path tree of the previous node. We empirically show that our algorithm runs much faster and has better approximation ratio than a sophisticated existing method called DTZ. We demonstrate the effectiveness of our algorithm through experiments.作者: constellation 時(shí)間: 2025-3-28 16:09
Fast Approximation Algorithm for the 1-Median Problem node ., our algorithm repeatedly finds a better node by making use of a shortest path tree of the previous node. We empirically show that our algorithm runs much faster and has better approximation ratio than a sophisticated existing method called DTZ. We demonstrate the effectiveness of our algorithm through experiments.作者: 深淵 時(shí)間: 2025-3-28 21:54
Jean-Gabriel Ganascia,Philippe Lenca,Jean-Marc PetUp-to-date results.Fast-track conference proceedings.State-of-the-art research作者: duplicate 時(shí)間: 2025-3-28 23:38 作者: 解凍 時(shí)間: 2025-3-29 03:58
https://doi.org/10.1007/978-3-642-33492-4XML mining; autonomous exploration; data mining; huge network; reinforcement learning; algorithm analysis作者: 模范 時(shí)間: 2025-3-29 08:39 作者: Cpr951 時(shí)間: 2025-3-29 13:19 作者: IVORY 時(shí)間: 2025-3-29 17:50
Das Verfahren der Gew?sserstrukturkartierungdescription length principle, information theory, and statistical models have been introduced. We show the respective advantages and disadvantages of these approaches and their connections, and illustrate their usefulness on real life data. After this overview we move from itemsets to more complex p作者: Expediency 時(shí)間: 2025-3-29 21:30 作者: 上漲 時(shí)間: 2025-3-30 00:28
Erich Staudt,Marcus Kottmann,Richard Merker fast approximation of the Kullback-Leibler (KL) divergence as a criterion to merge the mixture components. The proposed methodology is used in mixture modelling of two chromosomal aberration datasets showing that model selection is efficient and effective.作者: muffler 時(shí)間: 2025-3-30 06:53 作者: cushion 時(shí)間: 2025-3-30 08:54
Declarative Modeling for Machine Learning and Data Miningdata mining, in which the user specifies the problem in a high level modeling language and the system automatically transforms such models into a format that can be used by a solver to efficiently generate a solution. This should be much easier for the user than having to implement or adapt an algor作者: Gyrate 時(shí)間: 2025-3-30 15:15 作者: 墻壁 時(shí)間: 2025-3-30 18:37 作者: 反叛者 時(shí)間: 2025-3-30 22:33
Fast Progressive Training of Mixture Models for Model Selection fast approximation of the Kullback-Leibler (KL) divergence as a criterion to merge the mixture components. The proposed methodology is used in mixture modelling of two chromosomal aberration datasets showing that model selection is efficient and effective.作者: 單挑 時(shí)間: 2025-3-31 02:45
Predicting Ramp Events with a Stream-Based HMM Frameworkto occur..We compare SHRED framework against Persistence baseline in predicting ramp events occurring in short-time horizons, ranging from 30 minutes to 90 minutes. SHRED consistently exhibits more accurate and cost-effective results than the baseline.作者: 一大塊 時(shí)間: 2025-3-31 06:20
Large Scale Spectral Clustering Using Resistance Distance and Spielman-Teng Solvers Spielman and Teng near-linear time solver for systems of linear equations and random projection. Experiments on several synthetic and real datasets show that the proposed approach has better clustering quality and is faster than the state-of-the-art approximate spectral clustering methods.作者: Gullible 時(shí)間: 2025-3-31 09:55 作者: 不持續(xù)就爆 時(shí)間: 2025-3-31 16:55 作者: BLAND 時(shí)間: 2025-3-31 20:15 作者: Conquest 時(shí)間: 2025-3-31 22:56
Including Spatial Relations and Scales within Sequential Pattern Extractional scales. We propose an algorithm, STR_PrefixGrowth, which can be applied to a huge amount of data. The proposed method is evaluated on hydrological data collected on the Sa?ne watershed during the last 19 years. Our experiments emphasize the contribution of our approach toward the existing methods.作者: 嫻熟 時(shí)間: 2025-4-1 02:41
Conference proceedings 2012fic knowledge discovery, machine learning, intelligent data analysis, theory of learning, tools for supporting the human process of discovery in science, as well as their application to knowledge discovery.作者: rheumatology 時(shí)間: 2025-4-1 07:40 作者: 希望 時(shí)間: 2025-4-1 12:52
Wolfgang Stegmüller,Matthias Varga von Kibédulting subgroups are in fact less redundant compared to standard methods. In addition, our experiments show that the computational costs are significantly lower than the one of other methods compared in the paper.
