標題: Titlebook: Web Technologies Research and Development - APWeb 2005; 7th Asia-Pacific Web Yanchun Zhang,Katsumi Tanaka,Minglu Li Conference proceedings [打印本頁] 作者: 使委屈 時間: 2025-3-21 17:18
書目名稱Web Technologies Research and Development - APWeb 2005影響因子(影響力)
書目名稱Web Technologies Research and Development - APWeb 2005影響因子(影響力)學科排名
書目名稱Web Technologies Research and Development - APWeb 2005網(wǎng)絡公開度
書目名稱Web Technologies Research and Development - APWeb 2005網(wǎng)絡公開度學科排名
書目名稱Web Technologies Research and Development - APWeb 2005被引頻次
書目名稱Web Technologies Research and Development - APWeb 2005被引頻次學科排名
書目名稱Web Technologies Research and Development - APWeb 2005年度引用
書目名稱Web Technologies Research and Development - APWeb 2005年度引用學科排名
書目名稱Web Technologies Research and Development - APWeb 2005讀者反饋
書目名稱Web Technologies Research and Development - APWeb 2005讀者反饋學科排名
作者: Instantaneous 時間: 2025-3-21 21:48 作者: intelligible 時間: 2025-3-22 04:05
A Neural Network Approach to Web Graph Processingprogressively modify the linear matrix stochastic equation underlying the Google page rank determinations?[1] to one which may contain neural network formulations. Furthermore the capability of these modifications in determining personalized page ranks is demonstrated through a number of examples based on the web repository WT10G.作者: ALTER 時間: 2025-3-22 06:13
Languages for the Net: From Presentation to Collaborationration viewpoints. Then we discuss basic requirements for collaboration and present a programming model associated with our user-level programming language GSML, which has intrinsic support for collaboration. We outline the key features of GSML and its implementation architecture, and compare GSML with other models.作者: dandruff 時間: 2025-3-22 10:03 作者: 殘廢的火焰 時間: 2025-3-22 13:04
Languages for the Net: From Presentation to Collaborationration viewpoints. Then we discuss basic requirements for collaboration and present a programming model associated with our user-level programming language GSML, which has intrinsic support for collaboration. We outline the key features of GSML and its implementation architecture, and compare GSML with other models.作者: flavonoids 時間: 2025-3-22 19:24 作者: Baffle 時間: 2025-3-22 21:22 作者: visceral-fat 時間: 2025-3-23 01:28 作者: justify 時間: 2025-3-23 07:27 作者: Graves’-disease 時間: 2025-3-23 13:36
0302-9743 hanghai, China during March 29–April 1, 2005. APWeb is an international conference series on WWW technologies and is the primary forum for researchers and practitioners from both academia and industry to exchange knowledge on WWW-related technologies and new advanced applications. APWeb 2005 receive作者: Tincture 時間: 2025-3-23 17:52 作者: 織布機 時間: 2025-3-23 21:22 作者: 使害怕 時間: 2025-3-23 23:50
An Incremental Subspace Learning Algorithm to Categorize Large Scale Text DataCV1) dataset show that IIS outperforms state-of-the-art Incremental Principal Component Analysis (IPCA) algorithm, a related algorithm, and Information Gain in efficiency and effectiveness respectively.作者: 極為憤怒 時間: 2025-3-24 03:20 作者: opprobrious 時間: 2025-3-24 09:31 作者: ticlopidine 時間: 2025-3-24 11:29
A Unified Probabilistic Framework for Clustering Correlated Heterogeneous Web Objectstion) algorithm to estimate the parameters of the mixture model in one latent layer and propagate them to the other one. The experimental results show that our approach effectively combines the content and link features and improves the performance of the clustering.作者: modifier 時間: 2025-3-24 18:24
A Similarity Reinforcement Algorithm for Heterogeneous Web Pages the intuition that the intra-relationship should affect the inter-relationship, and vice versa. Experimental results on the MSN logs dataset show that our algorithm outperforms the traditional Cosine similarity.作者: beta-carotene 時間: 2025-3-24 19:00 作者: 脊椎動物 時間: 2025-3-25 01:10
Level-Based Link Analysisith the level properties of its two endings. Experiments on the topic distillation task of TREC2003 web track show that our algorithm can evidently improve searching results as compared to previous link analysis methods.作者: 統(tǒng)治人類 時間: 2025-3-25 06:12
Level-Based Link Analysisith the level properties of its two endings. Experiments on the topic distillation task of TREC2003 web track show that our algorithm can evidently improve searching results as compared to previous link analysis methods.作者: 諷刺 時間: 2025-3-25 07:54 作者: INCH 時間: 2025-3-25 12:21 作者: 暫時過來 時間: 2025-3-25 16:15
Databases and the Semantic Web: Data Semantics Revisitedh in the next millennium. The first, titled “Next Generation Database Systems Won’t Work Without Semantics” included as panelists Philip Bernstein, Umesh Dayal, John Mylopoulos (chair), Sham Navathe and Marek Rusinkiewicz. The second one, titled “Data Semantics Can’t Fail This Time!” included as pan作者: FOIL 時間: 2025-3-25 20:32 作者: 憤憤不平 時間: 2025-3-26 03:35
DSL Weaving for Distributed Information Flow Systemsgeneral purpose languages. Nevertheless, we felt some functionality for our information flow abstraction, Infopipes, might be best captures in aspects. In this paper, we describe a weaver built for domain specific languages (DSLs) related to Infopipes around an off-the-shelf XSLT processor. Aspects 作者: 推延 時間: 2025-3-26 04:56 作者: 是貪求 時間: 2025-3-26 11:46
Broadening Vector Space Schemes for Improving the Quality of Information Retrievalendent. We examine two information retrieval methods based on the simple vector space model. The first uses the query term position flow within the documents to calculate the document score, the second includes related terms in the query by making use of term correlations. Both of these methods show作者: guzzle 時間: 2025-3-26 16:03
Broadening Vector Space Schemes for Improving the Quality of Information Retrievalendent. We examine two information retrieval methods based on the simple vector space model. The first uses the query term position flow within the documents to calculate the document score, the second includes related terms in the query by making use of term correlations. Both of these methods show作者: 背信 時間: 2025-3-26 18:45 作者: Intractable 時間: 2025-3-26 23:19 作者: OVERT 時間: 2025-3-27 04:46 作者: conscience 時間: 2025-3-27 07:02
Some Issues for Fundamental Research on Information Sciences in Chinad considerations for fundamental research supported by the National Natural Science Foundation of China (NSFC) will be emphasized in this talk. First, the state of the research and development of information technology will be introduced and analyzed with a comparison between China and some other co作者: 形上升才刺激 時間: 2025-3-27 12:20
Languages for the Net: From Presentation to Collaborationstream that they limit the users’ creativities. In this article, we review existing languages for Internet applications, from presentation and collaboration viewpoints. Then we discuss basic requirements for collaboration and present a programming model associated with our user-level programming lan作者: 搏斗 時間: 2025-3-27 14:10
An Incremental Subspace Learning Algorithm to Categorize Large Scale Text Data problem. In this paper, we propose an incremental supervised subspace learning algorithm, called Incremental Inter-class Scatter (IIS) algorithm. Unlike traditional batch learners, IIS learns from a stream of training data, not a set. IIS overcomes the inherent problem of some other incremental ope作者: Malleable 時間: 2025-3-27 20:06
Some Issues for Fundamental Research on Information Sciences in Chinad considerations for fundamental research supported by the National Natural Science Foundation of China (NSFC) will be emphasized in this talk. First, the state of the research and development of information technology will be introduced and analyzed with a comparison between China and some other co作者: 遷移 時間: 2025-3-27 22:35
Classifying Criminal Charges in Chinese for Web-Based Legal Services comer, Web-based legal services have become another front in the arena. For instance, through such services, people obtain rough pictures of the lawsuits of interest before they decide whether and how to approach their counselors. As a step toward offering online legal services, we propose algorith作者: Spirometry 時間: 2025-3-28 02:57
An Incremental Subspace Learning Algorithm to Categorize Large Scale Text Data problem. In this paper, we propose an incremental supervised subspace learning algorithm, called Incremental Inter-class Scatter (IIS) algorithm. Unlike traditional batch learners, IIS learns from a stream of training data, not a set. IIS overcomes the inherent problem of some other incremental ope作者: acrobat 時間: 2025-3-28 08:20
Classifying Criminal Charges in Chinese for Web-Based Legal Services comer, Web-based legal services have become another front in the arena. For instance, through such services, people obtain rough pictures of the lawsuits of interest before they decide whether and how to approach their counselors. As a step toward offering online legal services, we propose algorith作者: 盟軍 時間: 2025-3-28 14:23
A Unified Probabilistic Framework for Clustering Correlated Heterogeneous Web Objectsnto account the relationship between data objects, but they either integrate content and link features into a unified feature space or apply a hard clustering algorithm, making it difficult to fully utilize the correlated information over the heterogeneous Web objects. In this paper, we propose a no作者: 亞當心理陰影 時間: 2025-3-28 15:59
A Unified Probabilistic Framework for Clustering Correlated Heterogeneous Web Objectsnto account the relationship between data objects, but they either integrate content and link features into a unified feature space or apply a hard clustering algorithm, making it difficult to fully utilize the correlated information over the heterogeneous Web objects. In this paper, we propose a no作者: Horizon 時間: 2025-3-28 20:04
CLINCH: Clustering Incomplete High-Dimensional Data for Data Mining Applicationning application, clustering incomplete high-dimensional data has becoming more and more useful. Motivated by these limits, we develop a novel algorithm ., which could produce fine clusters on incomplete high-dimensional data space. To handle missing attributes, CLINCH employs a prediction method th作者: 潔凈 時間: 2025-3-28 23:10
CLINCH: Clustering Incomplete High-Dimensional Data for Data Mining Applicationning application, clustering incomplete high-dimensional data has becoming more and more useful. Motivated by these limits, we develop a novel algorithm ., which could produce fine clusters on incomplete high-dimensional data space. To handle missing attributes, CLINCH employs a prediction method th作者: 刺耳 時間: 2025-3-29 07:01 作者: MENT 時間: 2025-3-29 10:23
Topic Discovery from Document Using Ant-Based Clustering Combinationdocument is represented as a vector of features in a vector space model. Then a hypergraph model is used to combine the clusterings produced by three kinds of ant-based algorithms with different moving speed. Finally, the topic of each cluster is extracted by re-computing the term weights. Test resu作者: AWE 時間: 2025-3-29 11:47 作者: 鎮(zhèn)壓 時間: 2025-3-29 16:06 作者: 詢問 時間: 2025-3-29 22:28 作者: Limited 時間: 2025-3-30 00:25
A Similarity Reinforcement Algorithm for Heterogeneous Web Pagesel or Latent Semantic Index only used single relationship to measure the similarity of data objects. In this paper, we first use an Intra- and Inter- Type Relationship Matrix (IITRM) to represent a set of heterogeneous data objects and their inter-relationships. Then, we propose a novel similarity-c作者: elastic 時間: 2025-3-30 05:38 作者: Brocas-Area 時間: 2025-3-30 12:00
Constraint-Based Graph Mining in Large Databases rapidly during the web mining process. Recent work has highlighted the importance of constraint-based mining paradigm in the context of frequent itemsets, sequences, and many other interesting patterns in large database. However, it is still not clear how to push various constraints systematically作者: 莊嚴 時間: 2025-3-30 15:59
Estimating the Number of Substring Matches in Long String Databases context of alphanumeric selectivity estimation, a CS-tree (Count Suffix Tree), which is a variation of a suffix tree, has been used as a basic data structure to store statistical information for substrings. However, even though the CS-tree is useful to keep information about short strings such as n作者: 山間窄路 時間: 2025-3-30 19:40 作者: 臨時抱佛腳 時間: 2025-3-30 22:46
An Efficient Topic-Specific Web Text Filtering Frameworkontent. In this framework, a hybrid feature selection method is proposed, and a high efficient filtering engine is designed. In training, we select features based on CHI statistic and rough set theory, then to construct filter with Vector Space Model. We train our frame with huge datasets, and the r作者: medieval 時間: 2025-3-31 04:35
An Efficient Topic-Specific Web Text Filtering Frameworkontent. In this framework, a hybrid feature selection method is proposed, and a high efficient filtering engine is designed. In training, we select features based on CHI statistic and rough set theory, then to construct filter with Vector Space Model. We train our frame with huge datasets, and the r作者: 芭蕾舞女演員 時間: 2025-3-31 07:38
An Extension of UML Activity Diagram for Generation of XPDL Documentt to exchange the information of a business process created in different tools because of the distinct information formats used in different tools. The XML Process Definition Language(XPDL) forms a common interchange standard. Generally a business process model can be represented by the UML activity作者: 報復 時間: 2025-3-31 12:54
An Extension of UML Activity Diagram for Generation of XPDL Documentt to exchange the information of a business process created in different tools because of the distinct information formats used in different tools. The XML Process Definition Language(XPDL) forms a common interchange standard. Generally a business process model can be represented by the UML activity作者: 我不怕犧牲 時間: 2025-3-31 15:08
Block-Based Language Modeling Approach Towards Web Searchcoming more complex, each of them may contain some . discussing different topics. Consequently, the performance of statistic model for web document tends to be degraded by the mixture of topics. In this paper, we argue that segmenting Web page into several relatively independent blocks will assist t作者: CLASH 時間: 2025-3-31 17:33
Level-Based Link Analysis pages. Famous ranking algorithms, including PageRank and HITS, make use of hyperlinks to compute the importance. Those algorithms consider all hyperlinks identically in sense of recommendation. However, we find that the World Wide Web is actually organized with the natural multi-level structure. Be作者: JADED 時間: 2025-3-31 22:28
Block-Based Language Modeling Approach Towards Web Searchcoming more complex, each of them may contain some . discussing different topics. Consequently, the performance of statistic model for web document tends to be degraded by the mixture of topics. In this paper, we argue that segmenting Web page into several relatively independent blocks will assist t作者: forthy 時間: 2025-4-1 02:33 作者: 狗窩 時間: 2025-4-1 07:48 作者: LARK 時間: 2025-4-1 12:21 作者: 喃喃訴苦 時間: 2025-4-1 15:11 作者: myopia 時間: 2025-4-1 20:57 作者: 卵石 時間: 2025-4-2 01:02
Constraint-Based Graph Mining in Large Databasenstr.int-.ased .raph M.ing) to push them into mining process by their categories. Non-monotonic aggregates like average also can be pushed into . with minor revision. Experimental results show that . can prunes a large search space effectively by pushing graph-based constraints into mining process.作者: Mets552 時間: 2025-4-2 04:45 作者: 領帶 時間: 2025-4-2 08:26 作者: Forage飼料 時間: 2025-4-2 14:58
Block-Based Language Modeling Approach Towards Web Searchto two parts: the probability of a query occurring in a block, and the probability of a block occurring in a Web page. Then given a query, those pages with more relevant blocks tend to be retrieved. Experimental results show that when unigram model is used, our approach outperforms original language modeling for web search in most cases.作者: 膽汁 時間: 2025-4-2 16:32 作者: 能得到 時間: 2025-4-2 19:42 作者: 悲痛 時間: 2025-4-3 01:15 作者: 紅腫 時間: 2025-4-3 05:40
Some Issues for Fundamental Research on Information Sciences in Chinaally, research activities and achievements on some technologies and applications of the Internet and the Web will be described. In this talk, considerations and policies, including the policies for encouraging international coordination, of the NSFC will also be explained. The information of the pri作者: ELATE 時間: 2025-4-3 08:37 作者: GUILT 時間: 2025-4-3 12:39
