標(biāo)題: Titlebook: Big Data Analytics and Knowledge Discovery; 17th International C Sanjay Madria,Takahiro Hara Conference proceedings 2015 Springer Internati [打印本頁(yè)] 作者: cherub 時(shí)間: 2025-3-21 17:25
書(shū)目名稱(chēng)Big Data Analytics and Knowledge Discovery影響因子(影響力)
書(shū)目名稱(chēng)Big Data Analytics and Knowledge Discovery影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Big Data Analytics and Knowledge Discovery網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Big Data Analytics and Knowledge Discovery網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Big Data Analytics and Knowledge Discovery被引頻次
書(shū)目名稱(chēng)Big Data Analytics and Knowledge Discovery被引頻次學(xué)科排名
書(shū)目名稱(chēng)Big Data Analytics and Knowledge Discovery年度引用
書(shū)目名稱(chēng)Big Data Analytics and Knowledge Discovery年度引用學(xué)科排名
書(shū)目名稱(chēng)Big Data Analytics and Knowledge Discovery讀者反饋
書(shū)目名稱(chēng)Big Data Analytics and Knowledge Discovery讀者反饋學(xué)科排名
作者: 羊齒 時(shí)間: 2025-3-21 22:07 作者: palpitate 時(shí)間: 2025-3-22 02:33 作者: Chauvinistic 時(shí)間: 2025-3-22 05:37
978-3-319-22728-3Springer International Publishing Switzerland 2015作者: Salivary-Gland 時(shí)間: 2025-3-22 09:40
Big Data Analytics and Knowledge Discovery978-3-319-22729-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 偽善 時(shí)間: 2025-3-22 12:57 作者: 細(xì)節(jié) 時(shí)間: 2025-3-22 17:07
Introducing Foreign Models for Developmentmilarity measures and traditional clustering algorithms are not reliable in separating clusters from each other. For example, when too many dimensions are considered simultaneously, objects become unique and (dis-)similarity does not provide meaningful information to detect clusters anymore. While t作者: 寬宏大量 時(shí)間: 2025-3-23 00:14 作者: 特別容易碎 時(shí)間: 2025-3-23 05:03
Introduction to Using a Computer System,ould find the complete set of patterns and then apply a post-pruning step to it. The size of the complete mining results is typically prohibitively large, despite the fact that only a small percentage of high utility patterns are interesting. Thus it is inefficient to wait for the mining algorithm t作者: 大氣層 時(shí)間: 2025-3-23 06:27
Composing Functions Using Pipelininguently, they require a significant amount of storage space to capture all existential probability values among the items in the data. To reduce the amount of required storage space, some existing algorithms (e.g., PUF-growth) combine nodes with the same item by storing an upper bound on expected sup作者: Bravado 時(shí)間: 2025-3-23 10:24
Functional Programming Overviewwever incurs security and privacy issues. To address the issues, this paper proposes two protocols for mining frequent patterns securely on the cloud by employing fully homomorphic encryption. One protocol requires little communication between the client and the cloud service provider, the other inc作者: 改變 時(shí)間: 2025-3-23 15:34 作者: 諷刺滑稽戲劇 時(shí)間: 2025-3-23 18:22 作者: 前面 時(shí)間: 2025-3-23 23:22
https://doi.org/10.1007/978-1-4842-1031-4d decision making in data analytics processes. This paper investigates how to build discrimination-aware models even when the available training set is intrinsically discriminating based on some sensitive attributes, such as race, gender or personal status. We propose a new classification method cal作者: AUGUR 時(shí)間: 2025-3-24 03:15
https://doi.org/10.1007/978-3-030-67626-1s of these big data. Users (or social entities) in these social networks are often linked by some interdependency such as friendship or “following” relationships. As these big social networks keep growing, there are situations in which individual users or businesses want to find those frequently fol作者: zonules 時(shí)間: 2025-3-24 07:44
The 3 A’s of a Machine Learning Projectety of topics. As social networks and microblogging services become more popular, the need to mine and analyze their content grows. We study the task of sentiment analysis in the well-known social network Twitter (.). We present a case study on tweets written in Greek and propose an effective method作者: ALT 時(shí)間: 2025-3-24 11:24
Christopher M. Rosett,Austin Hagertye Data extraction are either template-dependent or they are limited to comment-posting-structure discovery. We are not aware of any technique that extracts the detailed comment information like comment text, commenter and discussion structure from the comment page. In this paper, we present a templa作者: labyrinth 時(shí)間: 2025-3-24 16:24
Christopher M. Rosett,Austin Hagertyneous network into a homogeneous network before applying a similarity measure. However, such transformation results in information loss as path semantics are lost. In this paper, we study the problem of measuring relatedness between objects in a heterogeneous network using only link information and 作者: 俗艷 時(shí)間: 2025-3-24 20:01
High Availability in a Sandbox,y pair of entities. We present an approach to querying for similar individuals across multiple ontologies that makes use of the correspondences discovered during ontology alignment in order to reduce this cost. The query algorithm is designed using the framework of fuzzy logic and extends fuzzy onto作者: 制造 時(shí)間: 2025-3-25 00:12
Introduction to High Availability,se of heterogeneity issues and sparsity of data. In this paper we present a semantics-based approach for dynamic calculation of PIs in the context of sparse distributed data marts. In particular, we propose to enrich the multidimensional model with the formal description of the structure of an indic作者: 租約 時(shí)間: 2025-3-25 06:14 作者: CHOKE 時(shí)間: 2025-3-25 09:46
Finding Banded Patterns in Data: The Banded Pattern Mining Algorithmorithms. In this paper the exact . dimensional Banded Pattern Mining (BPM) algorithm is presented together with a full evaluation of its operation. To illustrate the utility of the banded pattern concept a case study using the Great Britain (GB) Cattle movement database is also presented.作者: installment 時(shí)間: 2025-3-25 13:29 作者: delusion 時(shí)間: 2025-3-25 17:03 作者: 四目在模仿 時(shí)間: 2025-3-25 22:30
Supervised Evaluation of Top-, Itemset Mining Algorithmsgorithms and diverse cost functions on several datasets from the UCI repository. As contribution, we show that ..?performs best in the majority of the cases, since the classifiers built over the mined patterns used as dataset features are the most accurate.作者: ALIBI 時(shí)間: 2025-3-26 02:16 作者: 本土 時(shí)間: 2025-3-26 07:02
Introducing Foreign Models for Developmentthout human intervention. This paper presents two novel techniques to cluster citations according to their contents (semantic) and the citation sentence styles (syntactic). The techniques are validated using external test sets from existing supervised citation classification studies.作者: configuration 時(shí)間: 2025-3-26 10:57
Functional Programming Overviews two advantages: one is stronger privacy protection, and the other is that the outsourced data can be used in different mining tasks. Experimental evaluation demonstrates that the proposed protocols provide a feasible solution to the issues.作者: A簡(jiǎn)潔的 時(shí)間: 2025-3-26 16:15 作者: pester 時(shí)間: 2025-3-26 18:46
High Availability in a Sandbox,alignment links. We evaluate the approach using both publicly available ontologies and from an enterprise-scale dataset. Experiments show that it is possible to trade-off a small decrease in precision of the query results with a large savings in execution time.作者: 舔食 時(shí)間: 2025-3-26 22:51
Unsupervised Semantic and Syntactic Based Classification of Scientific Citationsthout human intervention. This paper presents two novel techniques to cluster citations according to their contents (semantic) and the citation sentence styles (syntactic). The techniques are validated using external test sets from existing supervised citation classification studies.作者: 審問(wèn) 時(shí)間: 2025-3-27 01:08 作者: Observe 時(shí)間: 2025-3-27 05:47 作者: Enthralling 時(shí)間: 2025-3-27 11:39
UFOMQ: An Algorithm for Querying for Similar Individuals in Heterogeneous Ontologiesalignment links. We evaluate the approach using both publicly available ontologies and from an enterprise-scale dataset. Experiments show that it is possible to trade-off a small decrease in precision of the query results with a large savings in execution time.作者: ANTIC 時(shí)間: 2025-3-27 16:45 作者: Banister 時(shí)間: 2025-3-27 20:14 作者: Jingoism 時(shí)間: 2025-3-27 23:42 作者: Reservation 時(shí)間: 2025-3-28 06:10
Introducing Functional Programming Using C#orithms. In this paper the exact . dimensional Banded Pattern Mining (BPM) algorithm is presented together with a full evaluation of its operation. To illustrate the utility of the banded pattern concept a case study using the Great Britain (GB) Cattle movement database is also presented.作者: affinity 時(shí)間: 2025-3-28 09:25
Introduction to High Availability,ator given in terms of its algebraic formula and aggregation function. Upon such a model, a set of reasoning-based functionalities are capable to mathematically manipulate formulas for dynamic aggregation of data and computation of indicators on-the-fly, by means of recursive application of rewriting rules based on logic programming.作者: 團(tuán)結(jié) 時(shí)間: 2025-3-28 13:50 作者: 講個(gè)故事逗他 時(shí)間: 2025-3-28 17:24 作者: BLA 時(shí)間: 2025-3-28 19:38 作者: 奇怪 時(shí)間: 2025-3-29 02:45
Balancing Tree Size and Accuracy in Fast Mining of Uncertain Frequent Patternse algorithm. Our experimental results reveal a diminishing return on performance as the bound is increasingly tightened, allowing us to make a recommendation on the most effective use of extra storage towards increasing the efficiency of the algorithm.作者: 災(zāi)難 時(shí)間: 2025-3-29 05:51 作者: monologue 時(shí)間: 2025-3-29 08:04 作者: inconceivable 時(shí)間: 2025-3-29 13:46 作者: staging 時(shí)間: 2025-3-29 15:49
A New Relevance Measure for Heterogeneous Networks to be measured. In order to validate the effectiveness of the proposed measure, we compared its performance with existing relevance measures which are semi-metric and applicable to heterogeneous networks. To show the viability and the effectiveness of the proposed measure, experiments were performe作者: cutlery 時(shí)間: 2025-3-29 23:38
Introducing Foreign Models for Developmentobjects in dimensions in linear time. Our algorithm exploits the ordered neighborhoods in order to find both the similar objects and the dimensions in which these objects show high similarity. Evaluation results show that our method is scalable with both database size and dimensionality and enhances作者: Anticoagulant 時(shí)間: 2025-3-30 03:10 作者: tooth-decay 時(shí)間: 2025-3-30 07:34
Composing Functions Using Pipelininge algorithm. Our experimental results reveal a diminishing return on performance as the bound is increasingly tightened, allowing us to make a recommendation on the most effective use of extra storage towards increasing the efficiency of the algorithm.作者: 使隔離 時(shí)間: 2025-3-30 09:17
https://doi.org/10.1007/978-1-4842-1031-4scrimination-aware decision tree method. The results show that DAAR is able to effectively filter out the discriminatory rules and decrease the discrimination on all datasets with insignificant impact on the predictive accuracy.作者: Mast-Cell 時(shí)間: 2025-3-30 13:02
The 3 A’s of a Machine Learning Projectes in different languages. Our technique outperforms two out of the three methods we compared against and is on a par to the best of those methods, but it needs significantly less time for prediction and training.作者: 勉勵(lì) 時(shí)間: 2025-3-30 16:52
Christopher M. Rosett,Austin Hagerty the comments, commenter and discussion structure. Experimental studies on 19 well known Discourse websites having different templates show that our Comment Block discovery is more adaptable than the existing posting-structure discovery technique. We are able to extract 97?% of comment-text and 79?%作者: 不確定 時(shí)間: 2025-3-30 22:25
Christopher M. Rosett,Austin Hagerty to be measured. In order to validate the effectiveness of the proposed measure, we compared its performance with existing relevance measures which are semi-metric and applicable to heterogeneous networks. To show the viability and the effectiveness of the proposed measure, experiments were performe作者: Indolent 時(shí)間: 2025-3-31 04:29
