Filters








23,239 Hits in 4.6 sec

Towards Efficient Path Query on Social Network with Hybrid RDF Management [article]

Lei Gai, Wei Chen, Zhichao Xu, Changhe Qiu, Tengjiao Wang
2014 arXiv   pre-print
In this hybrid framework, we realize an efficient in-memory algebra operator for property path query using graph traversal, and estimate the cost of this operator to cooperate with existing cost-based  ...  present a main memory/disk based hybrid RDF data management framework for efficient property path query.  ...  For an online query, we implement a graph traversal based algebra operators for property path pattern, which is more efficient than traditional join-based operator. Contributions.  ... 
arXiv:1405.6500v2 fatcat:yfyym5stofamvgsc2d6h3757ym

DSM-PLW: Single-pass mining of path traversal patterns over streaming Web click-sequences

Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan
2006 Computer Networks  
In this paper, we propose a projection-based, single-pass algorithm, called DSM-PLW (Data Stream Mining for Path traversal patterns in a Landmark Window), for online incremental mining of path traversal  ...  inserted into a new in-memory summary data structure, called SPforest (Summary Path traversal pattern forest), which is an extended prefix tree-based data structure for storing essential information about  ...  We would like to thank Blue Martini Software for contributing the KDD Cup 2000 data. The research is supported in part by the National Science Council, Project No.  ... 
doi:10.1016/j.comnet.2005.10.018 fatcat:cn2aghozazfwnibdvhveigc5yy

On mining webclick streams for path traversal patterns

Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan
2004 Alternate track papers & posters of the 13th international conference on World Wide Web - WWW Alt. '04  
Modeling user access patterns as maximal forward references, we present a single-pass algorithm StreamPath for online discovering frequent path traversal patterns from an extended prefix tree-based data  ...  Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database.  ...  ACKNOWLEDGEMENTS The authors thank the reviewers for their valuable comments and suggestions with significantly improve the quality of this paper.  ... 
doi:10.1145/1010432.1010562 fatcat:5m77ojb7dzay5oayxda2333l7q

On mining webclick streams for path traversal patterns

Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan
2004 Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters - WWW Alt. '04  
Modeling user access patterns as maximal forward references, we present a single-pass algorithm StreamPath for online discovering frequent path traversal patterns from an extended prefix tree-based data  ...  Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database.  ...  ACKNOWLEDGEMENTS The authors thank the reviewers for their valuable comments and suggestions with significantly improve the quality of this paper.  ... 
doi:10.1145/1013367.1013497 dblp:conf/www/LiLS04 fatcat:p7tjmtl6dfczhkhsbr2zhkarme

VIRTUAL REALITY BASED END-USER ASSESSMENT TOOL FOR REPORT PRODUCT AND SYSTEM TESTING

Burcu Dolunary, Ali Akgunduz
2011 Proceedings of the Canadian Engineering Education Association (CEEA)  
An event based data collection and analysis approach is designed. Initial results support the usefulness of method as an automated tool to detect problems in an evaluated system  ...  It is known that a through understanding of the end-user is the most valuable information to improve design, training, maintenance and assembly/disassembly processes of products and systems.  ...  First approach is to cast the problem as one of mining traversal patterns in noisy data and find the frequent paths of each cluster.  ... 
doi:10.24908/pceea.v0i0.3836 fatcat:2pooa5dyszggdlvxw6qrk3ytc4

Pre-Order Post-Order Coded Aggregate Tree based Algorithm for Mining Sequential Patterns

2019 International Journal of Engineering and Advanced Technology  
Map (RLFOST-Map) for efficient representation of projected databases.  ...  We also developed an efficient Partially ordered Sequential PAttern Mining algorithm called PSPAM and Parallel implementation of Partially ordered Sequential PAttern Mining algorithm called PAPSPAM based  ...  In this paper the authors propose an efficient algorithm which can extract partially ordered sequential patterns without requiring repeated tree traversals for different possible extensions of a prefix-pattern  ... 
doi:10.35940/ijeat.a2030.109119 fatcat:6vqhvut62rg5hcllx723orhjty

Discovery of Popular Structural Properties in a Website for Personalization and Adaptation

Haider Ramadhan Al-Lawati, Ahmed Al-Hosni, Abdullah Al-Hamadani, Mohammad Al-Badawi
2011 Journal of Emerging Technologies in Web Intelligence  
Few changes to this algorithm are suggested to make it more suitable for the discovery of popular paths, pages and individual user behaviors in relation to the structural design of the sit.  ...  In this paper, we present a novel approach towards the discovery of target pages for shortcuts. The approach is based on the Maximal Forward Reference algorithm.  ...  traversals for the path ABC and one traversal for the path ABCD.  ... 
doi:10.4304/jetwi.3.3.253-260 fatcat:nbiyi3firncsvmonlxwpwcax7q

OSFPMiner: An Optimal Weighted Traversal Software Patterns Miner Based on Complex Network

Haitao He, Chun Shan, Hongdou He, Guyu Zhao, Yangsen Zhang, Xiangmin Tian
2020 Chinese journal of electronics  
The weighted traversal pattern is important in software system for a better understanding of the internal structure and behavior of software.  ...  The experimental results show that the proposed approach has good performance in the number of weighted frequent candidate patterns and time efficiency.  ...  The proposed Optimal software fault patterns miner (OSFPMiner) algorithm is stated in Section IV, and an example of the approach is given in Section V.  ... 
doi:10.1049/cje.2020.01.002 fatcat:37a3uma3hnbmdh5mtu2lfds2oe

An on-demand, link-state, multi-path QoS routing in a wireless mobile ad-hoc network

Yuh-Shyan Chen, Yu-Chee Tseng, Jang-Ping Sheu, Po-Hsuen Kuo
2004 Computer Communications  
To satisfy a given bandwidth requirement, the bandwidth calculation of the QoS route are determined at the destination to accurately determine the QoS uni-path or multi-path route depending on the status  ...  Our proposed scheme offers a bandwidth routing protocol for QoS support in a multihop mobile network.  ...  Comparing T-tree traversal with T LCF -tree traversal schemes, the T LCF -tree traversal scheme is more efficient than the T-tree traversal scheme.  ... 
doi:10.1016/s0140-3664(03)00176-2 fatcat:2f3ssii6fvhynguktordow754u

Incremental maintenance for materialized XPath/XSLT views

Makoto Onizuka, Fong Yee Chan, Ryusuke Michigami, Takashi Honishi
2005 Proceedings of the 14th international conference on World Wide Web - WWW '05  
This paper discusses the XPath/XSLT features of incremental view maintenance for subtree insertion/deletion and applies them to the maintenance algorithm.  ...  This paper proposes an incremental maintenance algorithm that efficiently updates the materialized XPath/XSLT views defined using XPath expressions in XP {[], * ,//,vars} .  ...  Other future work includes the efficient incremental maintenance of a large number of views and on an incremental update of the rendered presentations of HTML and SVG.  ... 
doi:10.1145/1060745.1060843 dblp:conf/www/OnizukaCMH05 fatcat:em7sqlqfcveg5i4azyrlp2dtme

Introduction of a New Index of Field Operations Efficiency

Kun Zhou, Dionysis Bochtis, Allan Leck Jensen, Dimitrios Kateris, Claus Grøn Sørensen
2020 Applied Sciences  
To this end, in this paper, a new index for field operability, the field traversing efficiency (FTE), a distance-based measure, is introduced and a dedicated tool for estimation of this measure is presented  ...  The evaluation and prediction of the agricultural machinery field efficiency is essential for agricultural operations management.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/app10010329 fatcat:f25cjdkpcbcivd3n6takkx4gxe

Incremental View Maintenance for Deductive Graph Databases Using Generalized Discrimination Networks

Thomas Beyhl, Holger Giese
2016 Electronic Proceedings in Theoretical Computer Science  
Furthermore, our evaluation shows that our approach can outperform existing approaches for the incremental maintenance of graph query results.  ...  We present an incremental maintenance algorithm for graph database views, which works for imperatively and declaratively specified graph queries.  ...  However, these approaches neither maintain graph pattern matches nor focus on the maintenance of such indexes. Model search approaches aim for the efficient retrieval of model elements.  ... 
doi:10.4204/eptcs.231.5 fatcat:zv2lxoyfavhmpk2wu7uw7km5bu

A portable compiler-integrated approach to permanent checking

Nic Volanschi
2007 Automated Software Engineering : An International Journal  
Minimalist user properties and languageindependent code pattern matching ensure that our approach can be integrated almost for free in any compiler for any language.  ...  We illustrate this approach with a fullfledged checking compiler for C. We demonstrate the need for permanent checking by partially analyzing two different releases of the Linux kernel.  ...  There are several possible reasons of this discrepancy, among which: • efficiency: most of the tools are not fast enough for everyday use.  ... 
doi:10.1007/s10515-007-0022-4 fatcat:wadtd6eq4bhrvnuce5vsha6d5m

A Portable Compiler-Integrated Approach to Permanent Checking

Nic Volanschi
2006 21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06)  
Minimalist user properties and languageindependent code pattern matching ensure that our approach can be integrated almost for free in any compiler for any language.  ...  We illustrate this approach with a fullfledged checking compiler for C. We demonstrate the need for permanent checking by partially analyzing two different releases of the Linux kernel.  ...  There are several possible reasons of this discrepancy, among which: • efficiency: most of the tools are not fast enough for everyday use.  ... 
doi:10.1109/ase.2006.8 dblp:conf/kbse/Volanschi06 fatcat:ilibv4jqz5ahvj6bifjvw3jmpu

Estimating Common Pedestrian Routes through Indoor Path Networks Using Position Traces

Thor S. Prentow, Henrik Blunck, Kaj Gronbaek, Mikkel B. Kjaergaard
2014 2014 IEEE 15th International Conference on Mobile Data Management  
The developed methods overcome three specific challenges for detecting commonly used routes in an indoor setting based on position data: i) a high ratio between path-density and positioningaccuracy, ii  ...  Through an evaluation based on data collected by staff members at a hospital covering more than 10 hectare over three floors, we show that the proposed methods detect routes that are representative of  ...  ACKNOWLEDGMENT We thank the employees of Aarhus University Hospital, Skejby, as well as Systematic for their help in data collection.  ... 
doi:10.1109/mdm.2014.11 dblp:conf/mdm/PrentowBGK14 fatcat:aqlhfqiuzfgblo4pklyls6zj5q
« Previous Showing results 1 — 15 out of 23,239 results