標(biāo)題: Titlebook: Data Warehousing and Knowledge Discovery; 4th International Co Yahiko Kambayashi,Werner Winiwarter,Masatoshi Arik Conference proceedings 20 [打印本頁] 作者: foresight 時(shí)間: 2025-3-21 16:08
書目名稱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é)科排名
作者: flex336 時(shí)間: 2025-3-21 22:59 作者: Mortar 時(shí)間: 2025-3-22 03:27
Mining Association Rules from XML DataL data sets a pressing need for languages and tools to manage collections of XML documents, as well as to . out of them. Although the data mining community has not yet rushed into the use of XML, there have been some proposals to exploit XML. However, in practice these proposals mainly rely on more 作者: Infect 時(shí)間: 2025-3-22 07:52 作者: Ventilator 時(shí)間: 2025-3-22 10:24 作者: Conscientious 時(shí)間: 2025-3-22 14:01 作者: Conscientious 時(shí)間: 2025-3-22 17:41 作者: wreathe 時(shí)間: 2025-3-23 00:51
A Hybrid Approach to Web Usage Miningsearch area.Web usage mining, which is the main topic of this paper, focuses on knowledge discovery from the clicks in the web log for a given site (the so-called click-stream), especially on analysis of . of clicks. Existing techniques for analyzing click sequences have different drawbacks, i.e., e作者: 翅膀拍動(dòng) 時(shí)間: 2025-3-23 03:04
Building and Exploiting Ad Hoc Concept Hierarchies for Web Log Analysis site owner. However, business goals refer to business objects rather than the page hits and script invocations recorded by the site server. Hence, Web usage analysis requires a preparatory mechanism that incorporates the business goals, the concepts reflecting them and the expert’s background knowl作者: 寬度 時(shí)間: 2025-3-23 05:47
Authorization Based on Evidence and Trust*h efforts grant privilege to a user based on her objective properties that are demonstrated by digital credentials (evidences). However, holding credentials is not sufficient to certify that a user is trustworthy. Therefore, we propose using the notion of trust to characterize the probability that a作者: Prognosis 時(shí)間: 2025-3-23 10:05
An Algorithm for Building User-Role Profiles in a Trust Environment1ole Based Access Control Methods (RBAC). RBAC architectures do not deal with each user separately, but with discrete roles that users can acquire in the system. The goal of this paper is to present a classification algorithm that during its training phase, classifies roles of the users in clusters. 作者: nascent 時(shí)間: 2025-3-23 16:31
Neural-Based Approaches for Improving the Accuracy of Decision Treesme. The dependencies among attributes are not considered in those algorithms. Unfortunately, in the real world, most datasets contain attributes, which are dependent. Generally, these dependencies are classified into two types: categorical- type and numerical-type dependencies. Thus, it is very impo作者: 庇護(hù) 時(shí)間: 2025-3-23 20:42 作者: indicate 時(shí)間: 2025-3-23 22:53 作者: 使無效 時(shí)間: 2025-3-24 05:11 作者: IRK 時(shí)間: 2025-3-24 06:53 作者: 周興旺 時(shí)間: 2025-3-24 13:04
Outlier Detection Using Replicator Neural Networksa mining to identify problems with the data itself, and to fraud detection where groups of outliers are often of particular interest. We use replicator neural networks (RNNs) to provide a measure of the outlyingness of data records. The performance of the RNNs is assessed using a ranked score measur作者: perjury 時(shí)間: 2025-3-24 15:24
The Closed Keys Base of Frequent Itemsetse representations of frequent itemsets have been investigated. In this paper, we present yet another concise representation of frequent itemsets, called the closed keys representation, with the following characteristics: (i) it allows to determine if an itemset is frequent, and if so, the support of作者: nutrition 時(shí)間: 2025-3-24 21:46
New Representation and Algorithm for Drawing RNA Structure with Pseudoknots*nd a possibly nonplanar graph) with inner cycles within a pseudoknot as well as possible outer cycles formed between a pseudoknot and other structural elements. Thus, drawing RNA pseudoknot structures is computationally more difficult than depicting RNA secondary structures. Although several algorit作者: PAD416 時(shí)間: 2025-3-25 00:09 作者: 情節(jié)劇 時(shí)間: 2025-3-25 06:19
David Zhang,Fangmei Chen,Yong XuNE RULE) that have been proposed for association rules extraction in the last years and discuss their common features and differences. We present them using a set of examples, taken from the real practice of data mining. This allows us to define the language design guidelines, with particular attention to the open issues on IDBs.作者: 遺留之物 時(shí)間: 2025-3-25 09:05
David Zhang,Fangmei Chen,Yong Xurd association rules with dissociation information, and presented some experimental results suggesting that such augmented rules can improve the quality of the associations obtained, both in terms of rule accuracy and in terms of using these rules as a guide to making decisions.作者: 休戰(zhàn) 時(shí)間: 2025-3-25 14:49
Gerhard A. Holzapfel,Ellen Kuhlaces. Based on the maximum likelihood principle, . is to optimize parameters to maximize the likelihood between data points and the modelgenerated by the parameters. Experimental results on both synthetic data sets and a realdata set show the efficiency and effectiveness of ..作者: 金盤是高原 時(shí)間: 2025-3-25 18:56 作者: Resign 時(shí)間: 2025-3-25 20:06
https://doi.org/10.1007/978-3-030-13712-0proximate solution found can be used for the computation of the exact solution. Although we are able to guarantee an .(.. ) approximation to the solution, where . = 1,…,∞ denotes the used .. metric, experimental results give the exact .-Closest-Pairs for all the data sets considered and show that the pruning of the search space is effective.作者: 治愈 時(shí)間: 2025-3-26 03:08 作者: FAST 時(shí)間: 2025-3-26 06:46 作者: attenuate 時(shí)間: 2025-3-26 11:19 作者: BARK 時(shí)間: 2025-3-26 15:26
Dynamic Similarity for Fields with NULL Valuescord Similarity. Furthermore, the percentage of correct duplicate records obtained by Dynamic Similarity but not obtained by Record Similarity will increase if the number of fields with NULL values increases.作者: 珊瑚 時(shí)間: 2025-3-26 19:27
David Zhang,Fangmei Chen,Yong Xue new challenges and opportunities that this topic sets to the data mining community. More specifically, we introduce an . for mining association rules. This extension is used throughout the paper to better define association rule mining within XML and to emphasize its implications in the XML context.作者: genuine 時(shí)間: 2025-3-26 22:34
https://doi.org/10.1007/978-94-007-5464-5s in . algorithm for fast association mining. Moreover, we explore the usefulness of the estimation methods in other mining/learning tasks [.]. Experimental results show the effectiveness of the estimation methods.作者: 最初 時(shí)間: 2025-3-27 02:12 作者: 讓步 時(shí)間: 2025-3-27 09:02
https://doi.org/10.1007/978-3-319-63504-0oriented concept hierarchies in Web usage analysis. We demonstrate our approach on a real data set and show how it can substantially improve both the search for interesting patterns by the mining algorithm and the interpretation of the mining results by the analyst.作者: OREX 時(shí)間: 2025-3-27 11:32 作者: definition 時(shí)間: 2025-3-27 14:20 作者: insurrection 時(shí)間: 2025-3-27 20:46
Mining Association Rules from XML Datae new challenges and opportunities that this topic sets to the data mining community. More specifically, we introduce an . for mining association rules. This extension is used throughout the paper to better define association rule mining within XML and to emphasize its implications in the XML context.作者: Insubordinate 時(shí)間: 2025-3-28 01:46
Estimating Joint Probabilities from Marginal Ones*s in . algorithm for fast association mining. Moreover, we explore the usefulness of the estimation methods in other mining/learning tasks [.]. Experimental results show the effectiveness of the estimation methods.作者: Metamorphosis 時(shí)間: 2025-3-28 05:39
An Efficient ,-Medoids-Based Algorithm Using Previous Medoid Index, Triangular Inequality Eliminationstrate that the proposed algorithm applied to . may reduce the number of distance calculations by 67% to 92% while retaining the same average distance per object. In terms of the running time, the proposed algorithm may reduce computation time by 38% to 65% compared with the . algorithm.作者: 洞察力 時(shí)間: 2025-3-28 10:17
Building and Exploiting Ad Hoc Concept Hierarchies for Web Log Analysisoriented concept hierarchies in Web usage analysis. We demonstrate our approach on a real data set and show how it can substantially improve both the search for interesting patterns by the mining algorithm and the interpretation of the mining results by the analyst.作者: 輕而薄 時(shí)間: 2025-3-28 11:44
An Algorithm for Building User-Role Profiles in a Trust Environment1sification phase). This algorithm will be incorporated in the Role Server architecture, currently under development, enhancing its ability to dynamically adjust the amount of trust of each user and update the corresponding role assignments.作者: 駕駛 時(shí)間: 2025-3-28 15:23
The Closed Keys Base of Frequent Itemsetsquent closed itemsets. An efficient algorithm for computing the closed key representation is offered. We show that our approach has many advantages over the existing approaches, in terms of efficiency, conciseness and information inferences.作者: profligate 時(shí)間: 2025-3-28 21:52 作者: 熟練 時(shí)間: 2025-3-29 02:03 作者: 使糾纏 時(shí)間: 2025-3-29 06:47 作者: neurologist 時(shí)間: 2025-3-29 07:56 作者: amenity 時(shí)間: 2025-3-29 15:23 作者: Bucket 時(shí)間: 2025-3-29 19:37
Conference proceedings 2002improve the quality of the results obtained from data analysis, decision support, and the automatic extraction of knowledge from data. The Fourth International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2002) continues a series of successful conferences dedicated to this topic. It作者: extinguish 時(shí)間: 2025-3-29 21:31 作者: 長(zhǎng)矛 時(shí)間: 2025-3-30 02:56
The Structure of Computer Networksr neural networks (RNNs) to provide a measure of the outlyingness of data records. The performance of the RNNs is assessed using a ranked score measure. The effectiveness of the RNNs for outlier detection is demonstrated on two publicly available databases.作者: 吞下 時(shí)間: 2025-3-30 04:16 作者: Barter 時(shí)間: 2025-3-30 12:14
Self-Tuning Clustering: An Adaptive Clustering Method for Transaction Dataorithm, . (standing for .), for clustering market-basket data. The objective of algorithm STC is “..” We conduct several experiments on the real data and the synthetic workload for performance studies. It is shown by our experimental results that by utilizing the self-tuning technique to adaptively 作者: 壯麗的去 時(shí)間: 2025-3-30 14:02
A Hybrid Approach to Web Usage Miningrmation, e.g., user demographics, to be included in the analysis without introducing performance problems. The development is driven by experiences gained from industry collaboration. A prototype has been implemented and experiments are presented that show that the hybrid approach performs well comp作者: meritorious 時(shí)間: 2025-3-30 18:59 作者: CRUC 時(shí)間: 2025-3-31 00:14 作者: Dysarthria 時(shí)間: 2025-3-31 04:50
New Representation and Algorithm for Drawing RNA Structure with Pseudoknots*ensional drawing and implemented the algorithm in a program. The new representation produces uniform and clear drawings with no edge crossing for all kinds of pseudoknots, including H-type and other complex types. Given RNA structure data, we represent the whole structure as a tree rather than as a 作者: Acetaldehyde 時(shí)間: 2025-3-31 06:27 作者: 開頭 時(shí)間: 2025-3-31 12:31 作者: 同時(shí)發(fā)生 時(shí)間: 2025-3-31 17:18 作者: 結(jié)合 時(shí)間: 2025-3-31 18:36
https://doi.org/10.1007/978-3-030-13712-0longer. Moreover, the maximum size of total memory required, which is independent of minimum support threshold in ., can be estimated. The experiments indicates that . outperforms both . and . algorithms. . also has good linear scalability even with very low minimum support. When the database is too作者: Brocas-Area 時(shí)間: 2025-3-31 21:55
Computer Network Architectures and Protocolsensional drawing and implemented the algorithm in a program. The new representation produces uniform and clear drawings with no edge crossing for all kinds of pseudoknots, including H-type and other complex types. Given RNA structure data, we represent the whole structure as a tree rather than as a 作者: 樹上結(jié)蜜糖 時(shí)間: 2025-4-1 01:57 作者: 籠子 時(shí)間: 2025-4-1 08:04 作者: interference 時(shí)間: 2025-4-1 11:36
