找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Knowledge Discovery in Inductive Databases; 5th International Wo Sašo Džeroski,Jan Struyf Conference proceedings 2007 Springer-Verlag Berli

[复制链接]
查看: 54996|回复: 59
发表于 2025-3-21 16:37:01 | 显示全部楼层 |阅读模式
书目名称Knowledge Discovery in Inductive Databases
副标题5th International Wo
编辑Sašo Džeroski,Jan Struyf
视频videohttp://file.papertrans.cn/544/543875/543875.mp4
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Knowledge Discovery in Inductive Databases; 5th International Wo Sašo Džeroski,Jan Struyf Conference proceedings 2007 Springer-Verlag Berli
出版日期Conference proceedings 2007
关键词Pattern Mining; classification; clustering; constraint-based mining; data management; data mining; databas
版次1
doihttps://doi.org/10.1007/978-3-540-75549-4
isbn_softcover978-3-540-75548-7
isbn_ebook978-3-540-75549-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2007
The information of publication is updating

书目名称Knowledge Discovery in Inductive Databases影响因子(影响力)




书目名称Knowledge Discovery in Inductive Databases影响因子(影响力)学科排名




书目名称Knowledge Discovery in Inductive Databases网络公开度




书目名称Knowledge Discovery in Inductive Databases网络公开度学科排名




书目名称Knowledge Discovery in Inductive Databases被引频次




书目名称Knowledge Discovery in Inductive Databases被引频次学科排名




书目名称Knowledge Discovery in Inductive Databases年度引用




书目名称Knowledge Discovery in Inductive Databases年度引用学科排名




书目名称Knowledge Discovery in Inductive Databases读者反馈




书目名称Knowledge Discovery in Inductive Databases读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:35:59 | 显示全部楼层
Frequent Pattern Mining and Knowledge Indexing Based on Zero-Suppressed BDDserns but also compactly indexes the output data in main memory. After mining, the pattern results can be analyzed efficiently by using algebraic operations. BDD-based data structures have previously been used successfully in VLSI logic design, but our method is the first practical application of BDD-based techniques in the data mining area.
发表于 2025-3-22 02:12:50 | 显示全部楼层
Three Strategies for Concurrent Processing of Frequent Itemset Queries Using FP-Growthications. The second is an implementation of the general idea of Common Counting for FP-growth. The last is a completely new strategy, motivated by identified shortcomings of the previous two strategies in the context of FP-growth.
发表于 2025-3-22 05:31:48 | 显示全部楼层
Mining Bi-sets in Numerical Datairectly numerical data to extract collections of relevant bi-sets, i.e., couples of associated sets of objects and attributes which satisfy some user-defined constraints. Not only we propose a new pattern domain but also we introduce a complete solver for computing the so-called numerical bi-sets. Preliminary experimental validation is given.
发表于 2025-3-22 08:45:21 | 显示全部楼层
Analysis of Time Series Data with Predictive Clustering Treeshows that Clus-TS is able to cluster genes with similar responses, and to predict the time series based on the description of a gene. Clus-TS is part of a larger project where the goal is to investigate how global models can be combined with inductive databases.
发表于 2025-3-22 16:19:58 | 显示全部楼层
Integrating Decision Tree Learning into Inductive Databasesrmat proposed earlier for association rules, and queryable using standard SQL; and we present a prototype system in which part of the needed functionality is implemented. In particular, we have developed an exhaustive tree learning algorithm able to answer a wide range of constrained queries.
发表于 2025-3-22 19:25:52 | 显示全部楼层
发表于 2025-3-22 22:12:46 | 显示全部楼层
发表于 2025-3-23 02:12:17 | 显示全部楼层
Extracting Trees of Quantitative Serial Episodeshaviors among the occurrences, according to the duration of the . steps, and providing quantitative bounds of these durations organized in a tree structure; (2) the possibility to extract them in a complete way; and (3) to perform such extractions at the cost of a limited overhead with respect to the extraction of standard episodes.
发表于 2025-3-23 06:57:53 | 显示全部楼层
IQL: A Proposal for an Inductive Query Languagetives. The language integrates ideas from several other declarative programming languages, such as pattern matching and function typing. We hope that it will be useful as an overall specification language for integrating data mining systems and principles.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-12 04:08
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表