標(biāo)題: Titlebook: Data Warehousing and Knowledge Discovery; 5th International Co Yahiko Kambayashi,Mukesh Mohania,Wolfram W?? Conference proceedings 2003 Spr [打印本頁(yè)] 作者: 拼圖游戲 時(shí)間: 2025-3-21 17:51
書目名稱Data Warehousing and Knowledge Discovery影響因子(影響力)
書目名稱Data Warehousing and Knowledge Discovery影響因子(影響力)學(xué)科排名
書目名稱Data Warehousing and Knowledge Discovery網(wǎng)絡(luò)公開度
書目名稱Data Warehousing and Knowledge Discovery網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Data Warehousing and Knowledge Discovery被引頻次
書目名稱Data Warehousing and Knowledge Discovery被引頻次學(xué)科排名
書目名稱Data Warehousing and Knowledge Discovery年度引用
書目名稱Data Warehousing and Knowledge Discovery年度引用學(xué)科排名
書目名稱Data Warehousing and Knowledge Discovery讀者反饋
書目名稱Data Warehousing and Knowledge Discovery讀者反饋學(xué)科排名
作者: 自戀 時(shí)間: 2025-3-21 22:51 作者: Amplify 時(shí)間: 2025-3-22 03:22
Computer Integrated Manufacturing K-means based classifiers. The experimental results show that IBC significantly outperforms the companion methods in execution efficiency for dataset with categorical attributes of sparse distribution while attaining approximately the same classification accuracies. Consequently, IBC is considered 作者: 非實(shí)體 時(shí)間: 2025-3-22 06:26
A Temporal Study of Data Sources to Load a Corporate Data Warehousetime or not, we could obtain the valid time for the data warehouse or not. The aim of this paper is to present a temporal study of the different kinds of data sources to load a corporate data warehouse, using a bitemporal storage structure.作者: poliosis 時(shí)間: 2025-3-22 11:44
Performance Tests in Data Warehousing ETLM Process for Detection of Changes in Data Origin The technique is simple and can be applied to all four scenarios above. To prove the efficiency of our technique, in this article we do comparative performance tests between these approaches. We performed two benchmarks: the first one using synthetic data and the second one using the real data from作者: 卵石 時(shí)間: 2025-3-22 14:50 作者: 卵石 時(shí)間: 2025-3-22 20:04 作者: 重力 時(shí)間: 2025-3-22 22:14 作者: exigent 時(shí)間: 2025-3-23 02:00 作者: Arroyo 時(shí)間: 2025-3-23 08:14 作者: 失望未來(lái) 時(shí)間: 2025-3-23 13:11
Conference proceedings 2003rague, Czech Republic in September 2003....The 41 revised full papers presented were carefully reviewed and selected from more than 130 submissions. The papers are organized in topical sections on data cubes and queries, multidimensional data models, Web warehousing, change detection, Web mining and作者: erythema 時(shí)間: 2025-3-23 16:13 作者: Figate 時(shí)間: 2025-3-23 20:38 作者: Inculcate 時(shí)間: 2025-3-24 01:05 作者: 凝乳 時(shí)間: 2025-3-24 05:36
Przemys?aw Ignaciuk,?ukasz Wieczorek novel presentational model for OLAP screens, intuitively based on the geometrical representation of a cube and its human perception in the space. Moreover, we show how the logical and the presentational models are integrated smoothly. Finally, we describe how typical OLAP operations can be easily mapped to the CPM.作者: 使?jié)M足 時(shí)間: 2025-3-24 08:56
Jerzy Balicki,Piotr Dryja,Marcin Zakidalskiaterialization, which in turn are leveraged by the OLAP system to efficiently answer spatial OLAP queries. Our prototype system shows that the proposed approach could be integrated easily into the existing data warehouse and OLAP systems to support spatial analysis. Preliminary experiment results are also presented.作者: 無(wú)政府主義者 時(shí)間: 2025-3-24 13:11 作者: Allergic 時(shí)間: 2025-3-24 16:22 作者: Carbon-Monoxide 時(shí)間: 2025-3-24 21:51
0302-9743 mproving data quality, queries and data patterns, improving database query engines, and sampling and vector classification..978-3-540-40807-9978-3-540-45228-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 貧窮地活 時(shí)間: 2025-3-25 00:01 作者: macabre 時(shí)間: 2025-3-25 06:29 作者: 領(lǐng)導(dǎo)權(quán) 時(shí)間: 2025-3-25 08:46 作者: gain631 時(shí)間: 2025-3-25 11:49
https://doi.org/10.1007/978-1-4471-3257-8attributes and the step of complete disjunctive coding, and on the other hand obtain a variable discretization of numeric attributes i.e. dependent on association of attributes. The study ends with an evaluation of an application to some banking data.作者: Neolithic 時(shí)間: 2025-3-25 16:58
W. F. Gielingh,W. J. de Bruijn,J. R. Halbertds. The experiments compare the performance of RDT with RS approach and ID3 algorithm. The performance of RDT over RS approach is observed better in accuracy and rule complexity while RDT and ID3 are comparable.作者: MOTTO 時(shí)間: 2025-3-26 00:04 作者: Tractable 時(shí)間: 2025-3-26 01:45 作者: incisive 時(shí)間: 2025-3-26 06:45
Building XML Data Warehouse Based on Frequent Patterns in User Querieslustering technique, the integration approach in the data warehouse is flexible with respect to obtaining and maintaining XML documents. Experiments show that the overall processing of the same queries issued against the global schema become much efficient by using the XML data warehouse built than by directly searching the multiple data sources.作者: 鐵砧 時(shí)間: 2025-3-26 10:37 作者: 牛的細(xì)微差別 時(shí)間: 2025-3-26 14:23
Rough Set Based Decision Tree Model for Classificationds. The experiments compare the performance of RDT with RS approach and ID3 algorithm. The performance of RDT over RS approach is observed better in accuracy and rule complexity while RDT and ID3 are comparable.作者: 教育學(xué) 時(shí)間: 2025-3-26 17:01
Janusz Rafa?ko,Andrzej Czy?ewski is more expensive computationally than P. Our contribution is in proposing a third new method, called the “Partial-Pre-aggregation” method (PP), which is significantly less expensive than F, but is just as accurate.作者: Obedient 時(shí)間: 2025-3-26 22:46 作者: 不能妥協(xié) 時(shí)間: 2025-3-27 03:20
Answering Joint Queries from Multiple Aggregate OLAP Databases is more expensive computationally than P. Our contribution is in proposing a third new method, called the “Partial-Pre-aggregation” method (PP), which is significantly less expensive than F, but is just as accurate.作者: Arboreal 時(shí)間: 2025-3-27 05:32 作者: 我沒有命令 時(shí)間: 2025-3-27 10:20
CPM: A Cube Presentation Model for OLAP novel presentational model for OLAP screens, intuitively based on the geometrical representation of a cube and its human perception in the space. Moreover, we show how the logical and the presentational models are integrated smoothly. Finally, we describe how typical OLAP operations can be easily mapped to the CPM.作者: 轎車 時(shí)間: 2025-3-27 13:50
An Approach to Enabling Spatial OLAP by Aggregating on Spatial Hierarchyaterialization, which in turn are leveraged by the OLAP system to efficiently answer spatial OLAP queries. Our prototype system shows that the proposed approach could be integrated easily into the existing data warehouse and OLAP systems to support spatial analysis. Preliminary experiment results are also presented.作者: FLIT 時(shí)間: 2025-3-27 19:20
A Multidimensional Aggregation Object (MAO) Framework for Computing Distributive Aggregationshow that caching intermediate aggregated data can significantly improve performance. Incremental compensating and full recomputing cache-updating approaches are proposed. Execution plans for deriving the aggregations from MAOs are presented. The proposed data aggregation technique can be applied to data-warehousing, OLAP, and data mining tasks.作者: 擁護(hù) 時(shí)間: 2025-3-28 01:41
MetaCube XTM: A Multidimensional Metadata Approach for Semantic Web Warehousing Systemserogeneous is presented. As a result, the interoperability is accomplished by a schema integration approach based on XTM. Furthermore, important implementation aspects of the MetaCube-XTM prototype, which makes use of the Meta Data Interchange Specification (MDIS), and the Open Information Model, complete the presentation of our approach.作者: outset 時(shí)間: 2025-3-28 02:23
Conference proceedings 2003 association rules, association rules and decision trees, clustering, association rule mining, data analysis and discovery, ontologies and improving data quality, queries and data patterns, improving database query engines, and sampling and vector classification..作者: thyroid-hormone 時(shí)間: 2025-3-28 07:43
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263210.jpg作者: 六邊形 時(shí)間: 2025-3-28 13:38 作者: 補(bǔ)角 時(shí)間: 2025-3-28 16:18 作者: 重疊 時(shí)間: 2025-3-28 22:44 作者: 嚴(yán)厲譴責(zé) 時(shí)間: 2025-3-28 23:32
Janusz Rafa?ko,Andrzej Czy?ewskises when it is not possible to derive the result from a single database. The method we use is the linear indirect estimator, commonly used for statistical estimation. We examine two obvious computational methods for computing such a target database, called the “Full-cross-product” (F) and the “Pre-a作者: 腐敗 時(shí)間: 2025-3-29 03:51 作者: FLASK 時(shí)間: 2025-3-29 10:30 作者: SPECT 時(shí)間: 2025-3-29 15:26
Anna M. Bartkowiak,Jerzy LiebhartDBT-98). The aim of this work is not to propose yet another multidimensional data model, but to find the general precise formalism encompassing all the proposals for a logical data model in the data warehouse field. Our proposal is compatible with all these proposals, making therefore possible a for作者: bronchiole 時(shí)間: 2025-3-29 19:20
Agnieszka Jastrzebska,Rafael Toro Sluzhenkoevels of management. The aim of the project is the development of a new online analytical processing oriented on case-based reasoning (CBR) where a previous experience for every new problem is taken into account. Methodological aspects have been tested in practice as a part of the management informa作者: delusion 時(shí)間: 2025-3-29 20:14 作者: nominal 時(shí)間: 2025-3-30 01:16
https://doi.org/10.1007/978-3-030-84340-3d, since XML is now a standard de facto for the exchange of semi-structured data, integrating XML data into web warehouses is a hot topic. In this paper we propose a semi-automated methodology for designing web warehouses from XML sources modeled by XML Schemas. In the proposed methodology, design i作者: Locale 時(shí)間: 2025-3-30 06:55 作者: 拉開這車床 時(shí)間: 2025-3-30 08:55 作者: 使顯得不重要 時(shí)間: 2025-3-30 13:16 作者: Microgram 時(shí)間: 2025-3-30 18:11 作者: 全神貫注于 時(shí)間: 2025-3-30 22:00
Computer Integrated Manufacturingsis, the HITS algorithm, calculates authority scores as the eigenvector of a adjacency matrix created from the Web graph. Although it was considered impossible to compute the eigenvector of a very large scale of Web graph using previous techniques, due to this calculation requires enormous memory sp作者: Seminar 時(shí)間: 2025-3-31 02:01
https://doi.org/10.1007/978-1-4471-3257-8transforming the initial set of attributes into binary attributes, thereby avoiding obtaining a prohibitive number of rules of little significance with many redundancies. This new kind of rule, ordinal association rules, reveals the overall behavior of the population and it is vital that this study 作者: 誘導(dǎo) 時(shí)間: 2025-3-31 09:02
W. F. Gielingh,W. J. de Bruijn,J. R. Halbert examples) by repeatedly splitting the training data set. ID3 is a greedy algorithm that considers one attribute at a time for splitting at a node. In C4.5, all attributes, barring the nominal attributes used at the parent nodes, are retained for further computation. This leads to extra overheads of作者: Clumsy 時(shí)間: 2025-3-31 12:44
Computer Integrated Manufacturingor classification. According to our observation on real data, the distribution of attributes with respect to information gain is very sparse because only a few attributes are major discriminating attributes where a discriminating attribute is an attribute, by whose value we are likely to distinguish作者: essential-fats 時(shí)間: 2025-3-31 13:40 作者: THE 時(shí)間: 2025-3-31 17:39
978-3-540-40807-9Springer-Verlag Berlin Heidelberg 2003作者: forbid 時(shí)間: 2025-4-1 00:34
Lecture Notes in Computer ScienceThe prospects of XML for data warehousing are staggering. As a primary purpose of data warehouses is to store non-operational data in the long term, i.e., to . them over time, the key reasons for the overwhelming success of XML as an . format also hold for data warehouses.作者: 排斥 時(shí)間: 2025-4-1 02:19
Computer Integrated ExperimentationWeb Usage Mining is that area of Web Mining which deals with the extraction of interesting knowledge from logging information produced by web servers. In this paper, we present a survey of the recent developments in this area that is receiving increasing attention from the Data Mining community.作者: 施舍 時(shí)間: 2025-4-1 09:28 作者: 難理解 時(shí)間: 2025-4-1 13:50
Recent Developments in Web Usage Mining ResearchWeb Usage Mining is that area of Web Mining which deals with the extraction of interesting knowledge from logging information produced by web servers. In this paper, we present a survey of the recent developments in this area that is receiving increasing attention from the Data Mining community.
