標題: Titlebook: Databases Theory and Applications; 25th Australasian Da Hua Wang,Mohamed A. Sharaf Conference proceedings 2014 Springer International Publi [打印本頁] 作者: 游牧 時間: 2025-3-21 17:00
書目名稱Databases Theory and Applications影響因子(影響力)
書目名稱Databases Theory and Applications影響因子(影響力)學(xué)科排名
書目名稱Databases Theory and Applications網(wǎng)絡(luò)公開度
書目名稱Databases Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Databases Theory and Applications被引頻次
書目名稱Databases Theory and Applications被引頻次學(xué)科排名
書目名稱Databases Theory and Applications年度引用
書目名稱Databases Theory and Applications年度引用學(xué)科排名
書目名稱Databases Theory and Applications讀者反饋
書目名稱Databases Theory and Applications讀者反饋學(xué)科排名
作者: 脫毛 時間: 2025-3-21 21:01 作者: interlude 時間: 2025-3-22 01:13
Ravi Sharma,Aparna Watve,Amitabh Pandeyogeneous datasets. The method integrates canonical correlation analysis (CCA) with graph mining to find top-... Several experimental studies are conducted on both synthetic and real-world datasets to demonstrate the effectiveness and efficiency of the proposed method.作者: AGOG 時間: 2025-3-22 05:57 作者: 減少 時間: 2025-3-22 12:41 作者: 背信 時間: 2025-3-22 13:07 作者: 背信 時間: 2025-3-22 20:19 作者: conduct 時間: 2025-3-22 22:59
Scalable Gaussian Process Regression for Prediction of Material Properties,e and efficient Gaussian process regression. The proposed strategy is applied to a real application involving the prediction of materials properties. Comprehensive tests have been conducted on two published properties data sets and the results demonstrate the high accuracy and efficiency of our new approach.作者: Myofibrils 時間: 2025-3-23 02:31
Discovering Collective Group Relationships,ogeneous datasets. The method integrates canonical correlation analysis (CCA) with graph mining to find top-... Several experimental studies are conducted on both synthetic and real-world datasets to demonstrate the effectiveness and efficiency of the proposed method.作者: Prognosis 時間: 2025-3-23 08:01 作者: 思考 時間: 2025-3-23 12:22
Mining the Association of Multiple Virtual Identities Based on Multi-Agent Interaction,process. Finally distributed knowledge is integrated on the basis of knowledge scale. Experiment with real-world dataset shows that MVIA-K has a very promising performance, which can filter the noise data effectively and outperform Author Topic model.作者: 騎師 時間: 2025-3-23 17:34 作者: 尾巴 時間: 2025-3-23 19:59
0302-9743 July 2014. The 15 full papers presented together with 6 short papers and 2 keynotes were carefully reviewed and selected from 38 submissions. A large variety of subjects are covered, including hot topics such as data warehousing; database integration; mobile databases; cloud, distributed, and parall作者: 換話題 時間: 2025-3-23 22:17
Conference proceedings 2014 The 15 full papers presented together with 6 short papers and 2 keynotes were carefully reviewed and selected from 38 submissions. A large variety of subjects are covered, including hot topics such as data warehousing; database integration; mobile databases; cloud, distributed, and parallel databas作者: eustachian-tube 時間: 2025-3-24 04:20
Conference proceedings 2014 processing and optimization; semi-structured data and XML; spatial data processing and management; stream and sensor data management; uncertain and probabilistic databases; web databases; graph databases; web service management; and social media data management.作者: pineal-gland 時間: 2025-3-24 06:54 作者: 騷擾 時間: 2025-3-24 13:22
Ravi Sharma,Aparna Watve,Amitabh Pandeyd” information from users. Furthermore, in the resource distribution stage, we propose to initialize the resource allocation according to user ratings, which also determines the resource transfer rates on links afterward. Extensive experiments conducted on real data validate the effectiveness of the proposed algorithm.作者: POLYP 時間: 2025-3-24 17:11
A Study on the Applications of Emerging Sequential Patterns,onclude with suggestions on future works that will improve current ESPs definition to enable detect non-trivial and interesting ESPs which can help increase the precision of predicting future emerging patterns with ESPs.作者: instill 時間: 2025-3-24 22:34
A Negative-Aware and Rating-Integrated Recommendation Algorithm Based on Bipartite Network Projectid” information from users. Furthermore, in the resource distribution stage, we propose to initialize the resource allocation according to user ratings, which also determines the resource transfer rates on links afterward. Extensive experiments conducted on real data validate the effectiveness of the proposed algorithm.作者: 阻止 時間: 2025-3-25 01:22
Dynamic Sorted Neighborhood Indexing for Real-Time Entity Resolution,entity. Indexing techniques are used to efficiently extract a set of candidate records from the database that are similar to a query record, and that are then compared with the query record in more details. The sorted neighborhood indexing method, which sorts a database and compares records within a作者: textile 時間: 2025-3-25 05:24 作者: antedate 時間: 2025-3-25 10:55
OSSM: The OLAP Security Specification Model,me, ensuring that legitimate requests can be consistently satisfied. Ultimately, such policies allow administrators to define a series of restrictions and/or exceptions that can be associated with the components of the OLAP data model, including elements such as dimensions, cells, and aggregation hi作者: nutrients 時間: 2025-3-25 15:23 作者: OTTER 時間: 2025-3-25 15:48 作者: 現(xiàn)任者 時間: 2025-3-25 19:58
Efficient Subgraph Matching Using GPUs, basic graph operation, subgraph matching is the foundation of many of these algorithms. Consequently, the efficiency of subgraph matching is very important and determines the speed of the whole data mining process. The development of multi-core CPUs allows subgraph matching algorithms to process mu作者: Eulogy 時間: 2025-3-26 03:02 作者: concise 時間: 2025-3-26 06:13 作者: CLAN 時間: 2025-3-26 08:33
Discovering Collective Group Relationships,ive relationships. On the other hand, collective relationshsips stimulate individual components to form groups. To gain clear understanding of the structure and functioning of these systems, it is necessary to identify both group formation and collective relationships at the same time. In this paper作者: 改變 時間: 2025-3-26 14:39 作者: Peak-Bone-Mass 時間: 2025-3-26 20:25 作者: 膠狀 時間: 2025-3-26 21:11 作者: Cervical-Spine 時間: 2025-3-27 01:26
Semi-supervised Learning for Cyberbullying Detection in Social Networks,tudies on cyberbullying detection are mainly supervised learning approaches, assuming data is sufficiently pre-labelled. However this is impractical in the real-world situation where only a small number of labels are available in streaming data. In this paper, we propose a semi-supervised leaning ap作者: RODE 時間: 2025-3-27 08:26 作者: Indurate 時間: 2025-3-27 09:30
Split Dictionaries for In-memory Column Stores in Mixed Workload Environments,orted dictionaries allow for more efficient query processing as comparisons can be performed directly on the compressed data whereas unsorted dictionaries are faster when inserting new values..In this work, we propose a new type of dictionary compression called Split Dictionaries. These organize the作者: NICHE 時間: 2025-3-27 17:07 作者: 下邊深陷 時間: 2025-3-27 17:50
XEdge: An Efficient Method for Returning Meaningful Clustered Results for XML Keyword Search, computing methodology, in order to make full use of the structural information of XML trees to extract features. In this method, we first propose the concept of Cluster Compactness Granularity (CCG) to partition the search results into different clusters, which enable users to precisely and quickly作者: 公社 時間: 2025-3-28 00:22
https://doi.org/10.1007/978-3-319-08608-8algorithms; big data; clustering; data management systems; data mining; data warehousing; database design 作者: CUB 時間: 2025-3-28 03:24 作者: FLING 時間: 2025-3-28 06:46
Jun Pan,Billy Tak Ming Wong,Honghua Wangentity. Indexing techniques are used to efficiently extract a set of candidate records from the database that are similar to a query record, and that are then compared with the query record in more details. The sorted neighborhood indexing method, which sorts a database and compares records within a作者: Glutinous 時間: 2025-3-28 12:46 作者: facetious 時間: 2025-3-28 15:25
Pension Fund Management. A Case Studyme, ensuring that legitimate requests can be consistently satisfied. Ultimately, such policies allow administrators to define a series of restrictions and/or exceptions that can be associated with the components of the OLAP data model, including elements such as dimensions, cells, and aggregation hi作者: 清晰 時間: 2025-3-28 19:42
https://doi.org/10.1007/978-3-658-24794-2 employed in recent years on a variety of problems. However the Gaussian process regression algorithm performs matrices inversions and the computational time can be extensive when accessing large training datasets. This is of critical importance when on-line learning and regression analyses are carr作者: vasculitis 時間: 2025-3-29 02:47 作者: ORBIT 時間: 2025-3-29 06:33 作者: Blazon 時間: 2025-3-29 09:04
Ravi Sharma,Aparna Watve,Amitabh Pandey Treating as resource in the network user taste for items, it allocates the resource via links between user nodes and item nodes. However, the taste model employed by existing algorithms cannot differentiate “dislike” and “unrated” cases implied by user ratings. Moreover, the distribution of resourc作者: incisive 時間: 2025-3-29 15:25 作者: cathartic 時間: 2025-3-29 18:37
Ravi Sharma,Aparna Watve,Amitabh Pandeyive relationships. On the other hand, collective relationshsips stimulate individual components to form groups. To gain clear understanding of the structure and functioning of these systems, it is necessary to identify both group formation and collective relationships at the same time. In this paper作者: 憎惡 時間: 2025-3-29 23:43 作者: 紀念 時間: 2025-3-30 03:56
Die erstaunliche Effektivit?t der fünf ?E“of parallel I/O processing. The I/O bottlenecks that HDDs on database systems face can be resolved by using SSDs because of these advantages. However, access latency on cache hierarchy may become a new bottleneck in SSD-based databases. In this study, we quantitatively analyzed the behavior of SSD-b作者: 影響深遠 時間: 2025-3-30 07:17 作者: COLIC 時間: 2025-3-30 09:18
Kartoffelchips vernetzter Kommunikationtudies on cyberbullying detection are mainly supervised learning approaches, assuming data is sufficiently pre-labelled. However this is impractical in the real-world situation where only a small number of labels are available in streaming data. In this paper, we propose a semi-supervised leaning ap作者: MAOIS 時間: 2025-3-30 16:27
Manfred Hasenbeck,Eberhard Wolfure of authors’ behavior in time slices and tries to mine the association of multiple virtual identities based on multi-agent interaction. We propose the recognition model MVIA-K based on knowledge management. In MVIA-K, agents perform distributed mining to get candidate author groups as local knowl作者: 吹牛者 時間: 2025-3-30 19:00 作者: Senescent 時間: 2025-3-31 00:38 作者: 搜尋 時間: 2025-3-31 01:48 作者: 一小塊 時間: 2025-3-31 05:02
Das Branding der Corporate Brand gestaltenThis paper explores a novel way of implementing set-valued operators that are used in analysis and retrieval in large social networks. The software we describe has been implemented and thoroughly tested in several demanding applications.作者: 誘拐 時間: 2025-3-31 11:47 作者: 高貴領(lǐng)導(dǎo) 時間: 2025-3-31 16:00
Databases Theory and Applications978-3-319-08608-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 厭食癥 時間: 2025-3-31 21:31
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263533.jpg作者: Chromatic 時間: 2025-3-31 22:25 作者: Postmenopause 時間: 2025-4-1 03:08
OSSM: The OLAP Security Specification Model,nts of the conceptual data model, the OSSM can be used by the associated security policy engine to transparently and consistently propagate constraints across all relevant levels of dimension hierarchies. We discuss the core elements of the OSSM, as well as the integration with the policy engine tha作者: 食料 時間: 2025-4-1 08:39 作者: Aura231 時間: 2025-4-1 11:36 作者: Ancestor 時間: 2025-4-1 14:41 作者: Diatribe 時間: 2025-4-1 21:28
Comprehensive Analytics of Large Data Query Processing on Relational Database with SSDs,fit into the cache size in SSD-based databases, which is in contrast to HDD-based databases, where hashtables require almost all of the available memory. Overall, our analytics clarify that the performance of multiple queries in SSD-based databases can be improved by considering data access locality
