標(biāo)題: Titlebook: Advances in Web-Age Information Management; Second International X. Sean Wang,Ge Yu,Hongjun Lu Conference proceedings 2001 Springer-Verlag [打印本頁] 作者: Menthol 時間: 2025-3-21 18:29
書目名稱Advances in Web-Age Information Management影響因子(影響力)
書目名稱Advances in Web-Age Information Management影響因子(影響力)學(xué)科排名
書目名稱Advances in Web-Age Information Management網(wǎng)絡(luò)公開度
書目名稱Advances in Web-Age Information Management網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Advances in Web-Age Information Management被引頻次
書目名稱Advances in Web-Age Information Management被引頻次學(xué)科排名
書目名稱Advances in Web-Age Information Management年度引用
書目名稱Advances in Web-Age Information Management年度引用學(xué)科排名
書目名稱Advances in Web-Age Information Management讀者反饋
書目名稱Advances in Web-Age Information Management讀者反饋學(xué)科排名
作者: Aspiration 時間: 2025-3-21 23:18 作者: 帶傷害 時間: 2025-3-22 03:28
978-3-540-42298-3Springer-Verlag Berlin Heidelberg 2001作者: 母豬 時間: 2025-3-22 07:09 作者: Glossy 時間: 2025-3-22 12:36 作者: Salivary-Gland 時間: 2025-3-22 15:05
https://doi.org/10.1007/978-3-030-55108-7s. Our index structure partitions a high-dimensional feature space into a group of cells and represents a feature vector as its corresponding cell signature. By using cell signatures rather than real feature vectors, it is possible to reduce the height of our high-dimensional index structure, leadin作者: incontinence 時間: 2025-3-22 18:50
SpringerBriefs in Computer Scienceon on new strategies for the adaptation and integration of database techniques regarding the management of multimedia data types at the particular conditions of mobile infrastructures. We believe that object-relational database systems e.g. Informix and Oracle8i are ideal repositories on the station作者: 故意釣到白楊 時間: 2025-3-22 21:24
https://doi.org/10.1007/978-3-030-55108-7n. In accordance with the rapid development of internet and WWW (World Wide Web), it has been getting more and more hard to pinpoint the appropriate document from the huge information resource. Various search engines have been developed to retrieve the appropriate information based on the keywords, 作者: 淡紫色花 時間: 2025-3-23 01:26 作者: 懦夫 時間: 2025-3-23 05:32 作者: effrontery 時間: 2025-3-23 09:41
https://doi.org/10.1007/978-3-540-69909-5ents. The old strategy based on keywords matching often leads to low precision. This article proposes a new model called CKPU (Classifying by key Phrase Understanding) including the key sentence template, mining threshold vector, objective and, subjective discriminating. The experiment result shows 作者: 身體萌芽 時間: 2025-3-23 14:31
Construction of Lyapunov Functions,al datasets for natural resource location, the task is to find high confidence rules even though the support may be low. In still other applications, such as the identification of agricultural pest infestations, the task is to find high confidence rules preferably while the support is still very low作者: 重畫只能放棄 時間: 2025-3-23 20:52
Construction of Lyapunov Functions,rated Neural Networks (SGNN), which is in turn based on both self-organizing neural network and concept formation. The complexity of the algorithm is at most O(MNlogN). With the distributed implementation the method can be easily scaled up. The method is independent of the order the web documents pr作者: Harbor 時間: 2025-3-23 22:16
https://doi.org/10.1007/978-3-540-69909-5the function are displayed in details, including data transfer, concept hierarchy generalization, mining rules with negative items and the re-development of the system. We also show an example of the tool’s application in this paper. Finally, some expectations for future work are presented.作者: fructose 時間: 2025-3-24 02:31
Construction of Lyapunov Functions, important issue, how to manage and apply the mined rules effectively is the same important. This paper presents a classification rule mining management system, named SM-Classifier, which integrates the functionality of generation, querying, maintenance and application of classification rules. The a作者: 寬大 時間: 2025-3-24 07:50 作者: 苦惱 時間: 2025-3-24 11:08
Mappings Near Separatrix. Theory, generation require DTD schema matching as a core procedure. While schema matching usually relies on a human arbiter, we are aiming at an automated system that can give the arbiter a starting point for designing a matching that can best meet the requirements of the given application. We present an a作者: depreciate 時間: 2025-3-24 17:33 作者: Cognizance 時間: 2025-3-24 21:52
https://doi.org/10.1007/978-981-13-6370-2e usually semi-structured or unstructured, the current database system need to be enhanced with the capabilities of dealing with path expressions and searching for information in text. In this paper, various index mechanisms, which can enhance the query engine of RDBMS with the capabilities of evalu作者: Ingratiate 時間: 2025-3-24 23:27 作者: 爵士樂 時間: 2025-3-25 04:33 作者: 新奇 時間: 2025-3-25 07:42 作者: 烤架 時間: 2025-3-25 13:06 作者: Decimate 時間: 2025-3-25 15:59 作者: 水獺 時間: 2025-3-25 20:54
Advances in Web-Age Information Management978-3-540-47714-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 使高興 時間: 2025-3-26 00:55
https://doi.org/10.1007/978-3-540-69909-5the function are displayed in details, including data transfer, concept hierarchy generalization, mining rules with negative items and the re-development of the system. We also show an example of the tool’s application in this paper. Finally, some expectations for future work are presented.作者: epicondylitis 時間: 2025-3-26 07:03 作者: 易受刺激 時間: 2025-3-26 12:15 作者: 不足的東西 時間: 2025-3-26 14:16 作者: 平庸的人或物 時間: 2025-3-26 17:57
https://doi.org/10.1007/978-3-030-55108-7f seach. Experiments were carried out to investigate the effectiveness of the proposed method and the result hinted the effectiveness of our approach as a pre-processing to narrow the scope of search for search engines.作者: 聯(lián)想 時間: 2025-3-27 00:12
Mappings Near Separatrix. Theory,ma equivalent and similar DTD elements. We have implemented the matching detection algorithm and several heuristics which improve performance. Our experimental results show reasonable precision of the algorithm in terms of recognition of correct matches.作者: blackout 時間: 2025-3-27 04:27
https://doi.org/10.1007/978-3-658-35999-7ty. The clustered values can be assigned to a common value that could be substituted for the original values. The paper describes and compares five different similarity measures for clustering and evaluates their performance on real-world data. The method we present may work well in practice but it is time-consuming.作者: 大洪水 時間: 2025-3-27 06:33
Utilizing the Correlation between Query Keywords for Information Retrievalf seach. Experiments were carried out to investigate the effectiveness of the proposed method and the result hinted the effectiveness of our approach as a pre-processing to narrow the scope of search for search engines.作者: 大漩渦 時間: 2025-3-27 09:46 作者: 清澈 時間: 2025-3-27 16:09
Comparing String Similarity Measures for Reducing Inconsistency in Integrating Data from Different Sty. The clustered values can be assigned to a common value that could be substituted for the original values. The paper describes and compares five different similarity measures for clustering and evaluates their performance on real-world data. The method we present may work well in practice but it is time-consuming.作者: Stagger 時間: 2025-3-27 20:02 作者: conception 時間: 2025-3-27 23:11
Similarity-Based Operators in Image Database Systemselational database paradigm. We then define novel similarity-based algebraic operators that are frequently required and study their properties in image database management systems. Finally, we investigate the possibilities of extending the proposed image table model to support salient-based operations on image database systems.作者: 含糊 時間: 2025-3-28 02:30 作者: 持續(xù) 時間: 2025-3-28 09:09 作者: HUMP 時間: 2025-3-28 12:07
https://doi.org/10.1007/978-3-030-55108-7 SRR scheme using MBR(Minimum Bounding Rectangle). Because our SRC and SRR schemes combine directional operators with positional operators, they can represent spatial relationships between icon objects precisely and can provide ranking for the retrieved images.作者: formula 時間: 2025-3-28 16:52 作者: FID 時間: 2025-3-28 19:10 作者: anesthesia 時間: 2025-3-29 00:01
https://doi.org/10.1007/978-3-540-69909-5arches. The search goal selected by the user allows the system to effectively (and automatically) prune the search results retrieved by free keyword searches. Tests show that the system provides better performance than existing search heuristics.作者: SLING 時間: 2025-3-29 03:42 作者: hankering 時間: 2025-3-29 10:35 作者: 農(nóng)學(xué) 時間: 2025-3-29 13:40 作者: brother 時間: 2025-3-29 18:58 作者: conference 時間: 2025-3-29 22:18 作者: 模范 時間: 2025-3-30 02:06 作者: 情節(jié)劇 時間: 2025-3-30 04:48
Goal-Oriented Information Retrieval Using Feedback from Usersarches. The search goal selected by the user allows the system to effectively (and automatically) prune the search results retrieved by free keyword searches. Tests show that the system provides better performance than existing search heuristics.作者: Herd-Immunity 時間: 2025-3-30 08:38 作者: Climate 時間: 2025-3-30 12:53
An Integrated Classification Rule Management System for Data Miningnt system, named SM-Classifier, which integrates the functionality of generation, querying, maintenance and application of classification rules. The architecture of SM-Classifier, the classification algorithm, the rule store structure, and the rule query operations are described.作者: 音樂等 時間: 2025-3-30 17:44 作者: 痛苦一下 時間: 2025-3-30 21:51
An XML Based Electronic Medical Record Integration System query request to SQLs understood by data sources, we decompose the query request to sub requests that are easier to convert. Each sub request is converted with the aid of the mapping data. And the results of all sub requests is combined into one XML documents conformed to a certain DTD.作者: 軟膏 時間: 2025-3-31 03:48
Enhancing XML Data Processing in Relational System with Indicessearching for information in text. In this paper, various index mechanisms, which can enhance the query engine of RDBMS with the capabilities of evaluating path expressions and supporting keywords search, are discussed. And some simple experiments are carried out to show the effectiveness of those indices.作者: demote 時間: 2025-3-31 07:28
A Multidimensional Data Model Supporting Complicated Aggregationsata of different levels can be kept consistent. The multidimensional data of different levels in a data cube are organized with so called aggregation nodes. We also define the operations on a data cube and illustrate the expressive power of the model by expressing analysis queries.作者: 充足 時間: 2025-3-31 12:13 作者: 侵害 時間: 2025-3-31 13:33
https://doi.org/10.1007/978-3-540-69909-5sons between the new models and the traditional models are carried out. The new models can improve query-processing efficiency considerably at the cost of much less amount of extra storage overhead compared to the size of original text database, so are suitable for applications of large-scale text databases, especially Chinese text databases.作者: 輕浮女 時間: 2025-3-31 17:38
SpringerBriefs in Computer Sciencehe data exchange and presentation by using media specific queries, data preprocessing and reduction methods within the database system. The server side data transformation and the presentation on mobile end system is controlled by RDF-based meta information and XML/XSLT technology. All these methods作者: exceed 時間: 2025-4-1 01:43
Construction of Lyapunov Functions,y-quadrant arrangement. Based on the P-tree, we build a special data cube, the Tuple Count Cube (T-cube), to derive high confidence rules. Our algorithm for deriving confident rules is fast and efficient. In addition, we discuss some strategies for avoiding over-fitting (removing redundant and misle作者: 是他笨 時間: 2025-4-1 03:41 作者: 急急忙忙 時間: 2025-4-1 08:49 作者: 新鮮 時間: 2025-4-1 11:16
Using Object-Relational Database Systems and XML in the Context of an Wireless-Oriented Multimedia Ihe data exchange and presentation by using media specific queries, data preprocessing and reduction methods within the database system. The server side data transformation and the presentation on mobile end system is controlled by RDF-based meta information and XML/XSLT technology. All these methods作者: 周年紀(jì)念日 時間: 2025-4-1 15:44
Deriving High Confidence Rules from Spatial Data Using Peano Count Treesy-quadrant arrangement. Based on the P-tree, we build a special data cube, the Tuple Count Cube (T-cube), to derive high confidence rules. Our algorithm for deriving confident rules is fast and efficient. In addition, we discuss some strategies for avoiding over-fitting (removing redundant and misle作者: 主動 時間: 2025-4-1 18:54
A Distributed Hierarchical Clustering System for Web Miningsed method, which can be used to automatically generate multimedia search engines, web directories, decision-making assistance systems, nowledge management systems, and personalized knowledge portals.作者: artifice 時間: 2025-4-1 23:03
Revisit on View Maintenance in Data Warehousesw complete consistent with the remote source data but also minimizes the number of accesses to the remote sites. In this paper we first show that a known SWEEP algorithm is one of the best algorithms for the case where multiple relations are included in a site. We then propose a complete consistency
