JP2010250823A - 大きな符号化サイズを有するグラフ探索問題への適用において幅優先探索戦略と深さ優先探索戦略とを組み合わせるシステム及び方法 - Google Patents
大きな符号化サイズを有するグラフ探索問題への適用において幅優先探索戦略と深さ優先探索戦略とを組み合わせるシステム及び方法 Download PDFInfo
- Publication number
- JP2010250823A JP2010250823A JP2010091247A JP2010091247A JP2010250823A JP 2010250823 A JP2010250823 A JP 2010250823A JP 2010091247 A JP2010091247 A JP 2010091247A JP 2010091247 A JP2010091247 A JP 2010091247A JP 2010250823 A JP2010250823 A JP 2010250823A
- Authority
- JP
- Japan
- Prior art keywords
- node
- search
- graph
- nodes
- decision tree
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computing arrangements using knowledge-based models
- G06N5/02—Knowledge representation; Symbolic representation
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Artificial Intelligence (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
【解決手段】本発明の一態様のグラフ探索方法は、順序付き決定ツリー構造を生成して、状態変数に対するテストを実行するように動作する決定ノードに対応する決定ツリーの内部ノードと、探索前線におけるノードに対応するリーフノードと、を有する探索前線ノードのセットを表すステップと、順序付き決定ツリー構造において深さ優先走査を実行して、次に拡張されるべきノードが現在のノードの近傍になるようにノードの拡張を順序付けるステップと、現在のノードの中間グラフを改変することによって、選択されたノードの中間グラフを導出するステップと、を包含する。
【選択図】図3
Description
Claims (4)
- グラフ探索方法であって、
順序付き決定ツリー構造を生成して、状態変数に対するテストを実行するように動作する決定ノードに対応する決定ツリーの内部ノードと、探索前線におけるノードに対応するリーフノードと、を有する探索前線ノードのセットを表すステップと、
前記順序付き決定ツリー構造において深さ優先走査を実行して、次に拡張されるべきノードが現在のノードの近傍になるようにノードの拡張を順序付けるステップと、
前記現在のノードの中間グラフを改変することによって、選択されたノードの中間グラフを導出するステップと、
を包含する、方法。 - 前記順序つき決定ツリー構造の生成及び前記中間グラフの導出は、幅優先アプローチを包含する、請求項1に記載の方法。
- 前記順序つき決定ツリー構造の生成及び前記中間グラフの導出は、最良優先アプローチを包含する、請求項1に記載の方法。
- システム内の状態又はイベント又は条件を検出するように動作するセンサと、
前記センサの出力に基づいて、前記システム又は前記システムのプロセスを制御するように動作するコントローラと、
前記システム又は前記システムのプロセスを診断する、前記コントローラ内部の診断モジュールと、
を備えており、
前記診断モジュールは、基本のベイジアン・ネットワークの最小幅に対応する診断状態変数の除去順を生成するように動作するツリー幅ソルバを有し、前記ツリー幅ソルバは、順序付き決定ツリー構造を使用して、状態変数に対するテストを実行するように動作する決定ノードに対応する決定ツリーの内部ノードと探索前線におけるノードに対応するリーフノードとを有する探索前線ノードのセットを表し、前記順序付き決定ツリー構造において深さ優先走査を実行して、次に拡張されるべきノードが現在のノードの近傍になるようにノードの拡張を順序付けし、且つ、前記現在のノードの中間グラフを改変することによって、選択されたノードの中間グラフを導出する、システム。
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/422,746 US8234233B2 (en) | 2009-04-13 | 2009-04-13 | System and method for combining breadth-first and depth-first search strategies with applications to graph-search problems with large encoding sizes |
US12/422,746 | 2009-04-13 |
Publications (2)
Publication Number | Publication Date |
---|---|
JP2010250823A true JP2010250823A (ja) | 2010-11-04 |
JP5650921B2 JP5650921B2 (ja) | 2015-01-07 |
Family
ID=42711905
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP2010091247A Expired - Fee Related JP5650921B2 (ja) | 2009-04-13 | 2010-04-12 | 大きな符号化サイズを有するグラフ探索問題への適用において幅優先探索戦略と深さ優先探索戦略とを組み合わせるシステム及び方法 |
Country Status (3)
Country | Link |
---|---|
US (1) | US8234233B2 (ja) |
EP (1) | EP2244212A1 (ja) |
JP (1) | JP5650921B2 (ja) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2017102733A (ja) * | 2015-12-02 | 2017-06-08 | パナソニックIpマネジメント株式会社 | 探索支援方法、探索支援装置、及び、プログラム |
CN115292571A (zh) * | 2022-08-08 | 2022-11-04 | 烟台中科网络技术研究所 | 一种App数据采集方法及系统 |
Families Citing this family (38)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8719771B2 (en) * | 2009-09-28 | 2014-05-06 | Cadence Design Systems, Inc. | Method and system for test reduction and analysis |
US8667012B2 (en) * | 2011-06-09 | 2014-03-04 | Salesforce.Com, Inc. | Methods and systems for using distributed memory and set operations to process social networks |
US9348766B2 (en) | 2011-12-21 | 2016-05-24 | Intel Corporation | Balanced P-LRU tree for a “multiple of 3” number of ways cache |
WO2013128974A1 (ja) * | 2012-03-02 | 2013-09-06 | インターナショナル・ビジネス・マシーンズ・コーポレーション | データ表示装置、データ表示方法およびプログラム |
US9244717B2 (en) * | 2012-03-29 | 2016-01-26 | Vmware, Inc. | Method and system for visualizing linked clone trees |
US20140279770A1 (en) * | 2013-03-15 | 2014-09-18 | REMTCS Inc. | Artificial neural network interface and methods of training the same for various use cases |
WO2015145555A1 (ja) * | 2014-03-25 | 2015-10-01 | 株式会社日立製作所 | 確率推論システム |
US20170308903A1 (en) * | 2014-11-14 | 2017-10-26 | Hewlett Packard Enterprise Development Lp | Satisfaction metric for customer tickets |
US9641452B2 (en) | 2014-11-25 | 2017-05-02 | Vmware, Inc. | Resolving a convex optimization problem to optimize network traffic in a distributed system |
US10608955B2 (en) | 2014-11-25 | 2020-03-31 | Vmware, Inc. | Reverse breadth-first search method for optimizing network traffic in a distributed system with a point of convergence |
CA2975591C (en) * | 2015-03-04 | 2020-08-25 | Landmark Graphics Corporation | Path optimization in production network systems |
US10503781B2 (en) * | 2015-04-14 | 2019-12-10 | Sap Se | Extending graph traversals with application logic |
US10133827B2 (en) | 2015-05-12 | 2018-11-20 | Oracle International Corporation | Automatic generation of multi-source breadth-first search from high-level graph language |
US10810257B2 (en) * | 2015-08-27 | 2020-10-20 | Oracle International Corporation | Fast processing of path-finding queries in large graph databases |
US10657180B2 (en) * | 2015-11-04 | 2020-05-19 | International Business Machines Corporation | Building and reusing solution cache for constraint satisfaction problems |
US9971570B2 (en) | 2015-12-15 | 2018-05-15 | Oracle International Corporation | Automated generation of memory consumption aware code |
US10169487B2 (en) | 2016-04-04 | 2019-01-01 | International Business Machines Corporation | Graph data representation and pre-processing for efficient parallel search tree traversal |
US20180074970A1 (en) * | 2016-09-09 | 2018-03-15 | Sap Se | Cache-Efficient Fragmentation of Data Structures |
US10719639B2 (en) | 2017-01-09 | 2020-07-21 | General Electric Company | Massively accelerated Bayesian machine |
US10540398B2 (en) | 2017-04-24 | 2020-01-21 | Oracle International Corporation | Multi-source breadth-first search (MS-BFS) technique and graph processing system that applies it |
US11023430B2 (en) * | 2017-11-21 | 2021-06-01 | Oracle International Corporation | Sparse dictionary tree |
US11169995B2 (en) | 2017-11-21 | 2021-11-09 | Oracle International Corporation | Relational dictionaries |
US11126611B2 (en) | 2018-02-15 | 2021-09-21 | Oracle International Corporation | Code dictionary generation based on non-blocking operations |
US11379450B2 (en) | 2018-10-09 | 2022-07-05 | Oracle International Corporation | Relational method for transforming unsorted sparse dictionary encodings into unsorted-dense or sorted-dense dictionary encodings |
US11036705B2 (en) | 2019-02-27 | 2021-06-15 | International Business Machines Corporation | Traversal of dispersed lockless concurrent index nodes |
CN110732138B (zh) * | 2019-10-17 | 2023-09-22 | 腾讯科技(深圳)有限公司 | 虚拟对象控制方法、装置、可读存储介质和计算机设备 |
US11392624B2 (en) | 2019-12-11 | 2022-07-19 | Oracle International Corporation | Hybrid in-memory BFS-DFS approach for computing graph queries against homogeneous graphs inside relational database systems |
US11392623B2 (en) | 2019-12-11 | 2022-07-19 | Oracle International Corporation | Hybrid in-memory BFS-DFS approach for computing graph queries against heterogeneous graphs inside relational database systems |
US11397732B2 (en) | 2019-12-11 | 2022-07-26 | Oracle International Corporation | Hybrid in-memory BFS-DFS approach for computing graph queries involving complex path patterns including trees and cycles inside relational database systems |
US11675785B2 (en) | 2020-01-31 | 2023-06-13 | Oracle International Corporation | Dynamic asynchronous traversals for distributed graph queries |
CN111462824B (zh) * | 2020-06-04 | 2023-08-08 | 东北大学 | 一种面向基因调控网络的可达概率查询方法 |
CN111967636A (zh) * | 2020-06-08 | 2020-11-20 | 北京大学 | 用于辅助决策配电网维修策略的系统和方法 |
US11456946B2 (en) | 2020-06-11 | 2022-09-27 | Oracle International Corporation | Regular path queries (RPQS) for distributed graphs |
US20220226994A1 (en) * | 2020-07-20 | 2022-07-21 | Georgia Tech Research Corporation | Heterogeneous graph attention networks for scalable multi-robot scheduling |
CN112525260B (zh) * | 2020-11-20 | 2022-04-29 | 杭州一益信息技术有限公司 | 一种导线弧垂双鉴监测方法 |
US12001425B2 (en) | 2020-12-09 | 2024-06-04 | Oracle International Corporation | Duplication elimination in depth based searches for distributed systems |
US20220345535A1 (en) * | 2021-04-26 | 2022-10-27 | Nokia Solutions And Networks Oy | Distribution of machine learning workflows on webscale infrastructures |
CN113408098A (zh) * | 2021-04-29 | 2021-09-17 | 北京理工大学 | 一种基于图搜索的最优二相码序列波形遍历搜索方法 |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2008256981A (ja) * | 2007-04-05 | 2008-10-23 | Fuji Xerox Co Ltd | 故障診断システム |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6629088B1 (en) * | 1999-11-30 | 2003-09-30 | Sony Corporation | Method and apparatus for measuring the quality of descriptors and description schemes |
EP1338128B1 (en) * | 2000-10-11 | 2006-06-07 | Broadcom Corporation | Efficiently transmitting RTP packets in a network |
US6983239B1 (en) * | 2000-10-25 | 2006-01-03 | International Business Machines Corporation | Method and apparatus for embedding grammars in a natural language understanding (NLU) statistical parser |
US6963831B1 (en) * | 2000-10-25 | 2005-11-08 | International Business Machines Corporation | Including statistical NLU models within a statistical parser |
US7103591B2 (en) * | 2002-12-02 | 2006-09-05 | International Business Machines Corporation | Method of describing business and technology information for utilization |
-
2009
- 2009-04-13 US US12/422,746 patent/US8234233B2/en active Active
-
2010
- 2010-04-12 JP JP2010091247A patent/JP5650921B2/ja not_active Expired - Fee Related
- 2010-04-12 EP EP10159602A patent/EP2244212A1/en not_active Ceased
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2008256981A (ja) * | 2007-04-05 | 2008-10-23 | Fuji Xerox Co Ltd | 故障診断システム |
Non-Patent Citations (2)
Title |
---|
JPN6014010678; Rong Zhou, Eric A. Hansen: 'Combining Breadth-First and Depth-First Strategies in Searching for Treewidth' Search in Artificial Intelligence and Robotics , 20080714, pp.162-168, The AAAI Press * |
JPN6014010679; Alexander Reinefeld, T. Anthony Marsland: 'Enhanced Iterative-Deepening Search' IEEE Transactions on Pattern Analysis and Machine Intelligence Vol.16, No.7, 199407, pp.701-710, IEEE * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2017102733A (ja) * | 2015-12-02 | 2017-06-08 | パナソニックIpマネジメント株式会社 | 探索支援方法、探索支援装置、及び、プログラム |
CN115292571A (zh) * | 2022-08-08 | 2022-11-04 | 烟台中科网络技术研究所 | 一种App数据采集方法及系统 |
CN115292571B (zh) * | 2022-08-08 | 2023-03-28 | 烟台中科网络技术研究所 | 一种App数据采集方法及系统 |
Also Published As
Publication number | Publication date |
---|---|
US20100262574A1 (en) | 2010-10-14 |
EP2244212A1 (en) | 2010-10-27 |
JP5650921B2 (ja) | 2015-01-07 |
US8234233B2 (en) | 2012-07-31 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP5650921B2 (ja) | 大きな符号化サイズを有するグラフ探索問題への適用において幅優先探索戦略と深さ優先探索戦略とを組み合わせるシステム及び方法 | |
Yang et al. | Adaptive fuzzy interpolation | |
Nair et al. | Networked distributed POMDPs: A synthesis of distributed constraint optimization and POMDPs | |
Ravindran et al. | Model minimization in hierarchical reinforcement learning | |
Malone et al. | Improving the scalability of optimal Bayesian network learning with external-memory frontier breadth-first branch and bound search | |
Mateescu et al. | AND/OR multi-valued decision diagrams (AOMDDs) for graphical models | |
Mathur et al. | The complexity of dynamic data race prediction | |
d’Angelo et al. | Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model | |
Izumi et al. | Mobile robots gathering algorithm with local weak multiplicity in rings | |
Wu et al. | Efficient and exact local search for random walk based top-k proximity query in large graphs | |
Marinescu et al. | Anytime best+ depth-first search for bounding marginal MAP | |
Balabonski et al. | A foundational framework for certified impossibility results with mobile robots on graphs | |
Yang et al. | Adaptive fuzzy interpolation with uncertain observations and rule base | |
Pelc | Deterministic gathering with crash faults | |
Davoodabadi et al. | A new method for discovering subgoals and constructing options in reinforcement learning. | |
Domshlak et al. | The complexity of optimal monotonic planning: The bad, the good, and the causal graph | |
Yanovski et al. | Vertex-Ant-Walk–A robust method for efficient exploration of faulty graphs | |
Zhang et al. | Can Transformer and GNN Help Each Other? | |
Ebnenasir et al. | Swarm synthesis of convergence for symmetric protocols | |
Chiu et al. | Automatic complexity reduction in reinforcement learning | |
Zhou et al. | Combining Breadth-First and Depth-First Strategies in Searching for Treewidth. | |
Hall | Complexity metrics for hierarchical state machines | |
Stern et al. | Finding patterns in an unknown graph | |
Kaepke et al. | A comparative evaluation of big data frameworks for graph processing | |
Kłopotek | Cyclic Bayesian network–Markov process approach |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
A621 | Written request for application examination |
Free format text: JAPANESE INTERMEDIATE CODE: A621 Effective date: 20130405 |
|
A131 | Notification of reasons for refusal |
Free format text: JAPANESE INTERMEDIATE CODE: A131 Effective date: 20140311 |
|
A601 | Written request for extension of time |
Free format text: JAPANESE INTERMEDIATE CODE: A601 Effective date: 20140606 |
|
A602 | Written permission of extension of time |
Free format text: JAPANESE INTERMEDIATE CODE: A602 Effective date: 20140611 |
|
A601 | Written request for extension of time |
Free format text: JAPANESE INTERMEDIATE CODE: A601 Effective date: 20140708 |
|
A602 | Written permission of extension of time |
Free format text: JAPANESE INTERMEDIATE CODE: A602 Effective date: 20140711 |
|
A601 | Written request for extension of time |
Free format text: JAPANESE INTERMEDIATE CODE: A601 Effective date: 20140805 |
|
A602 | Written permission of extension of time |
Free format text: JAPANESE INTERMEDIATE CODE: A602 Effective date: 20140808 |
|
A521 | Request for written amendment filed |
Free format text: JAPANESE INTERMEDIATE CODE: A523 Effective date: 20140910 |
|
TRDD | Decision of grant or rejection written | ||
A01 | Written decision to grant a patent or to grant a registration (utility model) |
Free format text: JAPANESE INTERMEDIATE CODE: A01 Effective date: 20141021 |
|
A61 | First payment of annual fees (during grant procedure) |
Free format text: JAPANESE INTERMEDIATE CODE: A61 Effective date: 20141114 |
|
R150 | Certificate of patent or registration of utility model |
Ref document number: 5650921 Country of ref document: JP Free format text: JAPANESE INTERMEDIATE CODE: R150 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
LAPS | Cancellation because of no payment of annual fees |