標(biāo)題: Titlebook: Data Warehousing and Knowledge Discovery; 12th International C Torben Bach Pedersen,Mukesh K. Mohania,A Min Tjoa Conference proceedings 201 [打印本頁(yè)] 作者: 軍械 時(shí)間: 2025-3-21 16:41
書(shū)目名稱Data Warehousing and Knowledge Discovery影響因子(影響力)
書(shū)目名稱Data Warehousing and Knowledge Discovery影響因子(影響力)學(xué)科排名
書(shū)目名稱Data Warehousing and Knowledge Discovery網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Data Warehousing and Knowledge Discovery網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Data Warehousing and Knowledge Discovery被引頻次
書(shū)目名稱Data Warehousing and Knowledge Discovery被引頻次學(xué)科排名
書(shū)目名稱Data Warehousing and Knowledge Discovery年度引用
書(shū)目名稱Data Warehousing and Knowledge Discovery年度引用學(xué)科排名
書(shū)目名稱Data Warehousing and Knowledge Discovery讀者反饋
書(shū)目名稱Data Warehousing and Knowledge Discovery讀者反饋學(xué)科排名
作者: aspect 時(shí)間: 2025-3-21 23:48 作者: extinguish 時(shí)間: 2025-3-22 03:04 作者: 紡織品 時(shí)間: 2025-3-22 06:25 作者: 斑駁 時(shí)間: 2025-3-22 12:16 作者: Hyperlipidemia 時(shí)間: 2025-3-22 16:31
Computer Analysis of Images and Patternssearches for core sets, i.e. groups of nodes that are densely connected to each other by efficiently exploring the two-dimensional core parameter space, and successively expands the identified cores by maximizing a local subgraph quality measure. We evaluate this scheme on three real-world tag netwo作者: Hyperlipidemia 時(shí)間: 2025-3-22 18:28
Computer Analysis of Images and Patternsg. These are also issues with respect to other forms of frequent pattern mining but are exacerbated in the context of frequent sub-graph mining. To reduced the search space, and address these twin overheads, a weighted approach to sub-graph mining is proposed. However, a significant issue in weighte作者: 急性 時(shí)間: 2025-3-23 01:10
Computer Analysis of Images and Patterns., contrary to traditional design approaches that assume that cluster nodes are instead ., and fragmentation and allocation phases are performed in a ., contrary to traditional design approaches that instead perform these phases in an .. Also, a naive replication algorithm that takes into account th作者: Jejune 時(shí)間: 2025-3-23 03:32 作者: Carcinogenesis 時(shí)間: 2025-3-23 07:01 作者: 挖掘 時(shí)間: 2025-3-23 10:55
Lecture Notes in Computer Science context is theoretically investigated, and we present both lossless and lossy pruning techniques. An efficient and scalable algorithm is proposed, which exploits the inclusion-exclusion principle for fast entropy computation. This algorithm is empirically evaluated through experiments on synthetic 作者: Resistance 時(shí)間: 2025-3-23 16:12
Lecture Notes in Computer Sciencerevious results, we restrict to the simple, but appealing subclass of simple conjunctive queries. The proposed algorithm makes use of the functional dependencies of the database to optimise the generation of queries and prune redundant queries. Furthermore, our algorithm is capable of detecting prev作者: 過(guò)剩 時(shí)間: 2025-3-23 20:14
Lecture Notes in Computer Scienceample-based correlation coefficient, the accuracy of the estimation is dependent on the quality and quantity of the sample. Like all statistical models, these correlation coefficients can suffer from overfitting, which results in the representation of random error instead of an underlying trend..In 作者: 冬眠 時(shí)間: 2025-3-23 22:14 作者: Glaci冰 時(shí)間: 2025-3-24 05:20
Computer Analysis of Images and Patternsh convergence has not been properly addressed so far. The current generation of stream processing systems isin general built separately from the data warehouse and query engine, which can causesignificant overhead in data access and data movement, and is unable to take advantage of the functionaliti作者: recession 時(shí)間: 2025-3-24 06:52 作者: Barter 時(shí)間: 2025-3-24 12:37
https://doi.org/10.1007/978-3-030-89128-2ures across a given image set. This paper describes and compares two such approaches. The first is founded on a weighted graph mining technique whereby the ROI is represented using a tree structure which allows the application of a weighted graph mining technique to identify features of interest, wh作者: PALSY 時(shí)間: 2025-3-24 17:05 作者: characteristic 時(shí)間: 2025-3-24 22:03
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263200.jpg作者: BILIO 時(shí)間: 2025-3-25 00:12
https://doi.org/10.1007/978-3-642-15105-7Business Intelligence; algorithms; business process intelligence; clustering; data cleansing; data mining作者: radiograph 時(shí)間: 2025-3-25 03:26
978-3-642-15104-0Springer-Verlag Heidelberg 2010作者: 裝飾 時(shí)間: 2025-3-25 08:04
Data Warehousing and Knowledge Discovery978-3-642-15105-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 五行打油詩(shī) 時(shí)間: 2025-3-25 15:13
Lecture Notes in Computer Science context is theoretically investigated, and we present both lossless and lossy pruning techniques. An efficient and scalable algorithm is proposed, which exploits the inclusion-exclusion principle for fast entropy computation. This algorithm is empirically evaluated through experiments on synthetic and real-world data.作者: OVERT 時(shí)間: 2025-3-25 17:43
0302-9743 lities in data analysis, decision support, and the automatic extraction of knowledge from data. With the exponentially growing amount of information to be included in the decision-making process, the data to be considered become more and more complex in both structure and semantics. New developments作者: 正式通知 時(shí)間: 2025-3-25 23:21
Computer Analysis of Images and Patterns., contrary to traditional design approaches that instead perform these phases in an .. Also, a naive replication algorithm that takes into account the heterogeneous characteristics of our reference architecture is proposed. Finally, our proposal is experimentally assessed and validated against the widely-known data warehouse benchmark ..作者: 陶器 時(shí)間: 2025-3-26 04:12 作者: 憤慨點(diǎn)吧 時(shí)間: 2025-3-26 05:25 作者: hieroglyphic 時(shí)間: 2025-3-26 09:12 作者: GIDDY 時(shí)間: 2025-3-26 13:24
Speeding Up Queries in Column Storesse of data compression techniques further reduces both memory consumption and processing time. In this paper we study query operators like scan and aggregation on compressed data structures implemented in TREX.作者: 小卷發(fā) 時(shí)間: 2025-3-26 19:53 作者: 向外才掩飾 時(shí)間: 2025-3-26 22:18 作者: podiatrist 時(shí)間: 2025-3-27 03:41 作者: sundowning 時(shí)間: 2025-3-27 09:11
Samya Amiri,Mohamed Ali Mahjoubving their counterparts in a multidimensional schema. Several heuristics –based on structural information derived from data sources– have been defined to this end and included in a set of Query/View/Transformation model transformations.作者: 種子 時(shí)間: 2025-3-27 09:27 作者: 溺愛(ài) 時(shí)間: 2025-3-27 14:29
Lecture Notes in Computer Sciencen communities and also because the nodes are likely to provide a deeper understanding of the communities. Our method outperforms the state-of-the-art method through experiments using data of DBLP records in terms of the subjective validness of the outputs.作者: diskitis 時(shí)間: 2025-3-27 18:15 作者: 租約 時(shí)間: 2025-3-28 01:34 作者: 演繹 時(shí)間: 2025-3-28 02:21 作者: PAD416 時(shí)間: 2025-3-28 08:18 作者: Paradox 時(shí)間: 2025-3-28 11:50 作者: 孵卵器 時(shí)間: 2025-3-28 16:03
Using Transitivity to Increase the Accuracy of Sample-Based Pearson Correlation Coefficientsoduct-moment correlation coefficient can significantly reduce the error, up to over 50%, of sparse, sample-based estimations. Finally, we demonstrate that if the data is too dense or too sparse, transitivity is detrimental in reducing the correlation estimation errors.作者: insolence 時(shí)間: 2025-3-28 22:45
Region of Interest Based Image Categorization scan data where the classification is focused on the ., a distinctive region in MRI brain scan data. Two scenarios are considered: distinguishing between musicians and non-musicians and epilepsy patient screening.作者: 失敗主義者 時(shí)間: 2025-3-29 00:32 作者: mutineer 時(shí)間: 2025-3-29 04:38
https://doi.org/10.1007/978-3-030-29888-3continuous fields. We give the syntax and semantics of the data types (and their operators) needed to support fields in SOLAP environments, and present an implementation of these types, on top of spatial-SQL. We also show how queries using the spatio-temporal operators for fields are written, parsed, and executed.作者: onlooker 時(shí)間: 2025-3-29 07:15 作者: NORM 時(shí)間: 2025-3-29 11:24 作者: 苦笑 時(shí)間: 2025-3-29 17:04 作者: burnish 時(shí)間: 2025-3-29 22:52 作者: 稱贊 時(shí)間: 2025-3-30 02:00
A Graph-Based Clustering Scheme for Identifying Related Tags in Folksonomiesrks by assessing the relatedness of same-cluster tags and by using tag clusters for tag recommendation. In addition, we compare our results to the ones derived from a baseline graph-based clustering method and from a popular modularity maximization clustering method.作者: HEAVY 時(shí)間: 2025-3-30 07:48 作者: Antioxidant 時(shí)間: 2025-3-30 09:33 作者: GLUE 時(shí)間: 2025-3-30 14:52
Logic Programming for Data Warehouse Conceptual Schema Validationdata warehouse conceptual schema is a specific process that precedes the translation of such a schema into a logical one. This activity must ensure that the data warehouse to be implemented effectively allows all the analytical queries to be executed correctly. To accomplish this, the validation pro作者: 半球 時(shí)間: 2025-3-30 17:11 作者: Synthesize 時(shí)間: 2025-3-30 21:36 作者: osteocytes 時(shí)間: 2025-3-31 02:04 作者: ROOF 時(shí)間: 2025-3-31 07:53
Discovering Community-Oriented Roles of Nodes in a Social Networkdegree and closeness do not take the community structure within a network into consideration. Furthermore, existing proposed community-based roles are defined using cliques, and thereby it is difficult to discover vertices with only few links that bridge communities. To overcome the shortcomings, we作者: acetylcholine 時(shí)間: 2025-3-31 10:37 作者: OFF 時(shí)間: 2025-3-31 16:20 作者: deceive 時(shí)間: 2025-3-31 19:59
